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 1955 - 1985 of 2737   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
1955
hi all, does anyone here have experience with logspace reducability? in particular Im interested in the "emptiness of CFL" problem which has been proven P...
vznuri
Offline Send Email
Feb 4, 2005
7:05 pm
1956
... Yes : anytime I read your prose... Take care! Po;-))) ... -- PôËt @:~?} Happy Moderator of PisNP@yahoogroups.com http://groups.yahoo.com/group/PisNP/ "La...
Po Ulpes
poulpes2004
Offline Send Email
Feb 4, 2005
11:35 pm
1957
Hi Vlad, ... Not exactly sure what you have in mind by "recent work on this", seeing as how the CFL emptiness problem P-completeness result dates back to the...
Kurt Van Etten
pnenp
Offline Send Email
Feb 6, 2005
4:01 am
1958
which is the most efficient algorithm of finding a k-clique in a graph G(V, E). According to Cormen, it is nCk * k(Squared); but has there been any better...
Dhananjay Kulkarni
kulkarni_dh
Offline Send Email
Feb 6, 2005
4:49 pm
1959
hi KLVE. thanks for the P time completeness ref. somehow I was recently wondering if one could study P vs NP via P time completeness. (I posted on this on...
vznuri
Offline Send Email
Feb 8, 2005
9:43 pm
1960
Hello, I have learnt that there are infinite turing machines which compute a function. The logic given is that, for a given function, there exists a turing...
idontcare634
Offline Send Email
Feb 9, 2005
6:50 am
1961
... From: idontcare634 [mailto:idontcare634@...] Sent: Wednesday, February 09, 2005 1:50 AM To: comp-sci-theory@yahoogroups.com Subject:...
Michael N. Christoff
crankyho2000
Offline Send Email
Feb 9, 2005
7:14 am
1962
... Hello, It looks like the value of c may depend on the number of states of the O(logn) space machine, which may then be dependent on the original Ptime...
ptt_hatred
Offline Send Email
Feb 9, 2005
4:46 pm
1963
tx for reply. I thought this too but then hopcroft/ullman go on to say that if CFL emptiness has a Dspace(log(n)^k) algorithm then P is contained in...
vznuri
Offline Send Email
Feb 9, 2005
7:11 pm
1964
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 : /NP !=...
comp-sci-theory@yahoo...
Send Email
Feb 10, 2005
9:51 pm
1965
... Hi all, Any Feedback welcome! Bests Ranj. ... 20AND%20CO-NP%20%21%3D%20P.pdf...
groverrajurenjit
groverrajure...
Offline Send Email
Feb 10, 2005
9:53 pm
1966
Hello, ... If we have a Dspace(log(n)^k) algorithm A for CFL emptiness, we can decide every L in P as follows (assuming R is a log space reduction from L to...
ptt_hatred
Offline Send Email
Feb 12, 2005
5:12 am
1968
hi all, I wonder if there is any info in the literature on what P!=Pspace would mean for P!=NP!=coNP ...? has anyone seen something like that? ps fyi, sipser...
vznuri
Offline Send Email
Feb 16, 2005
10:59 pm
1969
Hi everybody I got the address of this group from COMP.THEORY newsgroup. I need a help to prove this - from Intro to the theory of computation, chapter 9....
jackop1979
Offline Send Email
Feb 19, 2005
8:01 pm
1970
Hi Jack, ... I don't have the text handy right now, but I believe that the approach you want to use is this: Take the construction Sipser uses in the proof...
Kurt Van Etten
pnenp
Offline Send Email
Feb 20, 2005
4:32 am
1971
Thanks Kurt. But I`m still stuck and I don`t from where I can original 1975 paper. could you please help more. Thanks jack ... <jackop1979@y...> ... approach ...
jackop1979
Offline Send Email
Feb 21, 2005
7:04 am
1972
Hi again, ... When I have a chance, I'll take a look at the Sipser proof and make some suggestions (but I'm not sure how soon I'll have a chance to do that). ...
Kurt Van Etten
pnenp
Offline Send Email
Feb 21, 2005
6:32 pm
1973
... I got it through an Inter-Library loan from my local pulic library. They copied the pages from SIAM J. Comp. 4 and mail them to me. ib...
Igor B
herbegd
Offline Send Email
Feb 21, 2005
6:57 pm
1974
Hi : I'm a biologist/bioinformatician. I'm looking for a sample implementation for context-sensitive-HMM. Would anyone provide some reference implementation...
Premkumar N
pondyprem
Offline Send Email
Feb 24, 2005
12:39 am
1975
Can anyone solve following problem? Pove that 3SAT is polynomial reducible to the language R, R={ REX | REX is a regular expression such that the language of ...
nima
scientist_usair
Offline Send Email
Feb 24, 2005
11:29 pm
1976
Hi, I hope you have thought and solved this problem so far. If you haven't, here is the answer: Problem: Prove for every language A, there is a language B such...
nima
scientist_usair
Offline Send Email
Feb 25, 2005
12:20 am
1977
Porve for every language A, there is a language B such that A is turing reducible to B ( A<B) but B is not Turing reducible to A. Solution: We know that for...
nima
scientist_usair
Offline Send Email
Feb 25, 2005
1:02 am
1978
Pls. help me Let c1 xn + c2xn-1+…+ cnx + cnx + cn + 1 be a polynomial with a root at x = x0. Let Cmax be the largest absolute value of a c1 . Show that ......
plingam2001
Offline Send Email
Feb 27, 2005
11:15 pm
1979
Hello, How do i configure my grub so that i can start running a program of my intrest without loading the operating system. In the info page of grub it is...
com bio
combiofriends
Offline Send Email
Mar 1, 2005
9:25 am
1980
Can you help with this 9.5 Give a circuit that computes the parity function on three input variables and show how it computes on input 011. Jack...
jackop1979
Offline Send Email
Mar 2, 2005
12:33 am
1981
Hi, ... I couldn't help noticing that someone using the handle 'jackop' has been posting problems from Sipser chapter 9 in several different forums recently,...
Kurt Van Etten
pnenp
Offline Send Email
Mar 2, 2005
4:17 pm
1982
Hi, all guys.I have a problem below: there are many manhattan polygons in a box, and space in them regarded as occuppied already. Now we want to find the...
Steven.Zhao
yqoahz
Offline Send Email
Mar 2, 2005
4:53 pm
1983
... Linear in what? You're not very precise with your problem statement. At first sight [0] a generic sweep style algorithm would to the trick. Only occupied...
Lieven Marchand
lievenmarcha...
Offline Send Email
Mar 2, 2005
5:18 pm
1984
Hi Nima, ... I think your corollary should be that R is NP-hard, not NP-complete. I happened, just by coincidence, to be looking at this problem in Lewis and...
Kurt Van Etten
pnenp
Offline Send Email
Mar 2, 2005
7:50 pm
1985
Hello frnds can any one of you suggest me some sites(softwares) that have C programming for Robotics with simulation..ie.,if i write a program in C for...
Nanduuuuuuuuu
kishorev_nanda
Offline Send Email
Mar 3, 2005
12:30 am
Messages 1955 - 1985 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