hi all, I am sasikiran. I am a passive guy in this group till now. I need some information regarding code generation. Can anyone help me out in finding 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...
Aug 16, 2006 2:13 pm
2380
The cnfTo2cnf converter QfishC is coming along nicely. I found what appears to be an error in the preliminary results of all the other entrants on a 2006 velev...
Hi Daniel, I suggest you post a satisfying assignment to the original instance together with the name of the original file. There are 8 velev instances marked...
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...
Aug 21, 2006 5:28 pm
2383
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...
Aug 21, 2006 5:31 pm
2384
I posted 1cnfs for the two velev instances that I had. If you have a checking utility then just have it ignore the numbers that are above the known numbers in...
Is this the end of SAT race 2006? I confirm that you found satisfying solutions to the two "UNSAT" velev instances (not that I had doubts, just wanted be sure...
Daniel, found a file format mistake in the verifier code that I hacked, rats :( The following clause in velev-npe-1.0-02.cnf is not satisfied by your ...
As said this instance has to run for a day or so before getting anything. Recently repaired a nonobvious nested stacks bug so shall run npe2 again and let you...
I know that there are books written on this topic, so I'm probably full if sh-t. However, that dumb brain of mine felt like proving graphs to be isomorphic...
Sorry, guys! I found a significant flaw in my algorithm, and since Graph Isomorphism probably isn't in P, it's not likely I'll be able to fix it! Feel free...
I put in a couple more hours on it, and now the algorithm is giving correct results on the now many test-cases I've run. To get around the problem the...
Hi Bill, have you compared your algorithm with what is described in - http://scholar.google.com/ scholar?q=author:Hayes+intitle:%22On%20the%20Threshold%22 the...
... From: "Ashay Dharwadker" To: "Klaus D. Witzel" Subject: Four New Graph Algorithms Date: Tue, 26 Sep 2006 16:08:54 +0200 I have just updated my website with...
... From: "Ashay Dharwadker" To: "Klaus D. Witzel" Subject: Four New Graph Algorithms Date: Wed, 04 Oct 2006 11:26:11 +0200 ... graph in polynomial time... ......
Hi I am new in this forum and I don't have any background in logic and computability. I had a question " How do you prove from the definition of logical ...
Hi, There are a couple books you might want to try. By now, a classic text is: Computational Complexity, by Christos Papadimitriou A more text-book like, but...
... a ... a ... language. ... [some lines of the original post is removed here.] ... to ... 1* ... we ... is ... decidable ... other ... Hello everyone, after...
If EQREX = {<R,S> : R and S are equivalent regular expressions}, how do I prove that EQREX is in PSPACE? I thought about converting R and S into NFAs, and then...
(sorry if this is a double post) if EQREX={<R,S> : R and S are equivalent regular expressions}, how do I show that EQREX is in pspace? I thought about...
(sorry if this is a double post) if EQREX={<R,S> : R and S are equivalent regular expressions}, how do I show that EQREX is in pspace? I thought about...
... do I show that EQREX is ... pumping lemma, but I ... strings iff R and S are ... Hello, Here is a possible solution. Convert R and S into nondeterministic ...
... some ... is ... decidable ... all ... is ... want ... not ... 4.12, ... (G)) ... ``tree ... where ... all ... k. ... by ... repeated ... Now ... test ... ...
Hello, I have a question about decidability. First, consider the following: * The language of all "empty" Context-Free languages is decidable; that is, the...