hi all .. fyi in case you missed it, a link for a new wiki on the P vs NP problem. http://www.qeden.com/wiki/Main_Page looks halfway promising. I have huge...
... Very little of this is known. The sharpest known result at the moment is P!=EXPTIME. -- "a totalitarian ideology that hates freedom, rejects tolerance, and...
Hi, I'm trying to construct a polynomial transformation between 2SAT (2-Satisfiability) and 2DM (2-Dimensional Matching) . Any ideas? Also, how to prove that...
AOA readers i want to know about the research paper/journel at any plateform about the topic that two tapes are better than k-tapes without the involving time...
In the algorithm-forge Files section I posted a new Folder titled cnfTo2cnfs If the cst or te moderator wishes too they make a similar cnfTo2cnfs folder in...
Dear All I am preparing a research in Computer Science. In this research, I have made more than one model of interaction between server and client. I want to...
Hi I am doing Masters in computer science and i am finding a topic for my term paper in the course of theory of computation .plz help me in this regard by...
... for my term paper in the course of theory of computation .plz help me in this regard by suggesting a suitable easy topic along with at least three...
Hi this topic seems to be interesting but you should refer me two more papers based upon ur topic and if u have someother topics then plz let me know .Dont...
... papers based upon ur topic ... mail / give the link /reference of at least three papers ... I'm sure you'll be able to find two more papers given the...
Hi all. I've finally broken down and ordered two books in distributed computing from amazon.ca. I had been reading individual papers to build the bulk of my...
... Another good text on Distributed Computing is (of course) Andrew Tanenbaum's "Distributed Operating Systems," (Prentice-Hall, 1995, ISBN 0-13-219908-4)....
Here are another couple of good texts on the subject of DC: "Distributed Systems: Concepts and Design," by George Coulouris, Jean Dollimore and Tim Kindberg. ...
I guess you are not talking about books on Distributed Computing (DC), which is quite a bit different altogether than Distributed Systems (DS). In my...
Hi all. Thanks for the respones Keith and Janardan. At this point I'm interested in the theory of DC, so I would agree with Janardan that the books Keith...
Does anyone know where the solutions to sipser's exercises/problems are available on the net? the book in question is "Introduction to Theory of Computation"....
you can find the solutions of some problems from the homework solutions of some formal languages and automata theory courses.Mostly instructors upload the...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the comp-sci-theory group. File :...
comp-sci-theory@yahoo...
May 24, 2006 5:21 pm
2333
qfish2006 runs well on medium sized instances. It converts from the cnf format to 2cnf format. There are several possible applications. For a good time try the...
Can any one solve this problem? let C be the class of all decision problems that are polynomial time Turing redicible to some language L in (NP intersection...
Dear all, I recently realized that BTC (one of the problems I have been studying) is a generalization of the Disjoint Paths Problem. The reduction is actually...
hi! I am a undergraduate student. I need some help for my work. I have to develop a ANN program in c/c++ that will take say about 10 numeric parameters and...
If it is a function approximation problem, try using GRNN (General Regression Neural Network) which as you would be knowing is a kind of Radial Basis Neural...
I think you can solve it on two steps: Firsly, prove that C is subset from (NP intersection CoNP) Secondly, prove that ((NP intersections CoNP) difference C) =...
Hi, The problem with your solution is that you seem to assume that we are talking about many-one reductions, while the problem regards Turing reductions. Thus,...
hi all here is a sort of interesting but weird reduction that Id like to discuss with anyone. I may have mentioned some related ideas on this list at one pt. ...
Hi Vlad, ... It's been a long time since I've looked at HU79 (actually, it's been a long time since I've looked at any complexity theory), so I can't resist. ...
hi, This is kool ....try this link http://www.raxdev.com/?r=68EAFE37 Regards ks ... How low will we go? Check out Yahoo! Messenger’s low PC-to-Phone call...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
