Search the web
Sign In
New User? Sign Up
comp-sci-theory · Computer Science Theory
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Best of Y! Groups

   Check them out and nominate your group.
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.

Messages

  Messages Help
Advanced
Messages 2378 - 2432 of 2737   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
2378
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...
maddula n v sasikiran
kiranisanindian
Offline Send Email
Aug 14, 2006
5:29 am
2379
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...
Send Email
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...
pehoushek1
Offline Send Email
Aug 16, 2006
2:54 pm
2381
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...
Klaus D. Witzel
kwitzel
Offline Send Email
Aug 17, 2006
12:55 pm
2382
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...
Send Email
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...
Send Email
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...
pehoushek1
Offline Send Email
Aug 21, 2006
5:43 pm
2385
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...
Klaus D. Witzel
kwitzel
Offline Send Email
Aug 22, 2006
2:17 pm
2386
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 ...
Klaus D. Witzel
kwitzel
Offline Send Email
Aug 24, 2006
2:42 pm
2387
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...
Daniel Pehoushek
pehoushek1
Offline Send Email
Aug 28, 2006
7:55 pm
2388
Hi, I'm looking for recent references to hypercomputation or super-turing computation but it's very difficult to find anything... I only know ...
Carlo Comin
vl4dster
Offline Send Email
Aug 29, 2006
6:21 pm
2389
... super-turing ... Toby Ord, as his honors thesis, gave a nice little survey of hypercomputation; it's the first item linked to on this page: ...
Kurt Van Etten
pnenp
Offline Send Email
Aug 30, 2006
2:12 am
2396
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...
smilindog2000
Offline Send Email
Sep 21, 2006
8:44 pm
2397
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...
smilindog2000
Offline Send Email
Sep 21, 2006
9:51 pm
2399
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...
smilindog2000
Offline Send Email
Sep 22, 2006
1:17 pm
2400
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...
Klaus D. Witzel
kwitzel
Offline Send Email
Sep 23, 2006
6:47 am
2406
... 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...
Klaus D. Witzel
kwitzel
Offline Send Email
Oct 3, 2006
1:33 pm
2407
the first one shows how to cover the vertices of a graph in polynomial time... is this ok? am I missing something? ... From: Klaus D. Witzel To:...
Nicolás Vinacur
gring0ar
Offline Send Email
Oct 3, 2006
3:19 pm
2408
... 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... ......
Klaus D. Witzel
kwitzel
Offline Send Email
Oct 4, 2006
10:39 am
2415
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 ...
scorpion_king_ca
scorpion_kin...
Offline Send Email
Nov 1, 2006
8:31 pm
2422
Can anyone recommend a book to learn more automata theory/formal language theory/ complexity theory after Sipser's Theory of Computation?...
npeterson808080
Offline Send Email
Nov 14, 2006
2:41 am
2423
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...
Piotr Faliszewski
pfaliurcs
Offline Send Email
Nov 14, 2006
3:08 am
2424
... a ... a ... language. ... [some lines of the original post is removed here.] ... to ... 1* ... we ... is ... decidable ... other ... Hello everyone, after...
ptt_hatred
Offline Send Email
Nov 15, 2006
7:42 am
2426
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...
npeterson808080
Offline Send Email
Nov 17, 2006
12:57 am
2427
(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...
npeterson808080
Offline Send Email
Nov 17, 2006
1:02 am
2428
(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...
npeterson808080
Offline Send Email
Nov 17, 2006
1:04 am
2429
... 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 ...
ptt_hatred
Offline Send Email
Nov 17, 2006
7:23 am
2430
... some ... is ... decidable ... all ... is ... want ... not ... 4.12, ... (G)) ... ``tree ... where ... all ... k. ... by ... repeated ... Now ... test ... ...
ptt_hatred
Offline Send Email
Nov 20, 2006
4:51 pm
2431
Hello, I have a question about decidability. First, consider the following: * The language of all "empty" Context-Free languages is decidable; that is, the...
Hatem Abd-Elghani
hatem_abdel_...
Offline Send Email
Nov 22, 2006
3:01 pm
2432
... that is, ... decidable. ... Turing machine ... Sipser (Theorem ... accepting "all strings ... reasoning ... strings ... I guess the PDA accepting "all...
ptt_hatred
Offline Send Email
Nov 22, 2006
4:43 pm
Messages 2378 - 2432 of 2737   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help