comp.theory
- CFP: Advances in the Theory of Computing (AITC'09), special track of SYNASC, g.
- Re: Computer sciency stuff,
UKuser
- <Possible follow-ups>
- Re: Computer sciency stuff, UKuser
- Re: Creating a set of disjoint intervals from a set of overlapping intervals, matt . timmermans
- I Just Proved [P=NP] and I get to announce it on Usenet., Martin Michael Musatov
- multimedia, prathore2008
- Is this problem NP-hard?,
tmp123
- Re: Is this problem NP-hard?, Andrew Tomazos
- Re: Is this problem NP-hard?,
Andrew Tomazos
- Re: Is this problem NP-hard?,
Ben Bacarisse
- Re: Is this problem NP-hard?, Ben Bacarisse
- Re: Is this problem NP-hard?,
Ben Bacarisse
- Re: Is this problem NP-hard?,
Patricia Shanahan
- Re: Is this problem NP-hard?,
Andrew Tomazos
- Re: Is this problem NP-hard?, Andrew Tomazos
- Re: Is this problem NP-hard?, Patricia Shanahan
- Re: Is this problem NP-hard?, tmp123
- Re: Is this problem NP-hard?,
Andrew Tomazos
- A Question about NP,
dielanw
- Re: A Question about NP, Ertugrul Söylemez
- Re: A Question about NP, Tim Little
- Re: A Question about NP, Andrew Tomazos
- Re: A Question about NP,
tchow
- Re: A Question about NP, tchow
- PDA to CFG question, Zootal
- Extended draft paper submission: TMFCS-09 call for papers, devipsrs@xxxxxxxxx
- Weighted Singular Value Decomposition algorithm?,
Patricia Shanahan
- Re: Weighted Singular Value Decomposition algorithm?,
A.G.McDowell
- Re: Weighted Singular Value Decomposition algorithm?, Patricia Shanahan
- Re: Weighted Singular Value Decomposition algorithm?,
A.G.McDowell
- Re: December 21, 2012: Judgment Day, curious george
- How to determine accept state of a DFA,
Zootal
- Re: How to determine accept state of a DFA, Chris F Clark
- Re: How to determine accept state of a DFA, Cagdas Ozgenc
- Re: How to determine accept state of a DFA,
Andrew Tomazos
- Re: How to determine accept state of a DFA, Andrew Tomazos
- Re: How to determine accept state of a DFA, drugz'
- A Good and Clear Description of Recursion Theorem,
Edmon
- Re: A Good and Clear Description of Recursion Theorem, matt . timmermans
- Parma Polyhedra Library 0.10.1, Roberto Bagnara
- kolmogorov complexity estimator,
Cagdas Ozgenc
- Re: kolmogorov complexity estimator,
cplxphil
- Re: kolmogorov complexity estimator, Tim Little
- Re: kolmogorov complexity estimator, Denis
- Re: kolmogorov complexity estimator,
cplxphil
- FSMNLP 2009 - final call for full papers - full paper deadline extended to April 26, FSMNLP 2009
- Best stable sorting algorithm,
Andrew Tomazos
- Re: Best stable sorting algorithm,
Ben Pfaff
- Re: Best stable sorting algorithm,
Andrew Tomazos
- Re: Best stable sorting algorithm, Ben Pfaff
- Re: Best stable sorting algorithm,
Andrew Tomazos
- Re: Best stable sorting algorithm,
Richard Harter
- Re: Best stable sorting algorithm,
Andrew Tomazos
- Re: Best stable sorting algorithm, grpadmin
- Re: Best stable sorting algorithm,
Andrew Tomazos
- Re: Best stable sorting algorithm,
Ben Pfaff
- quote about random search?,
YKY (YAN King Yin, 甄景贤)
- Re: quote about random search?, Andrew Tomazos
- What's this logical operator called?,
JohnF
- Re: What's this logical operator called?,
Mark Murray
- Re: What's this logical operator called?, JohnF
- Re: What's this logical operator called?, Jesse F. Hughes
- Re: What's this logical operator called?, Mark Murray
- Re: What's this logical operator called?, Ben Pfaff
- Re: What's this logical operator called?,
Mark Wooding
- Re: What's this logical operator called?,
Ben Bacarisse
- Re: What's this logical operator called?, Ralph Boland
- Re: What's this logical operator called?, Mark T.B. Carroll
- Re: What's this logical operator called?, James Dow Allen
- Re: What's this logical operator called?, Ben Bacarisse
- Re: What's this logical operator called?, Patricia Shanahan
- Re: What's this logical operator called?, Harold Aptroot
- Re: What's this logical operator called?,
Ben Bacarisse
- Re: What's this logical operator called?,
Mark Murray
- A Useful Website for Computer Science Researchers - MyNetResearch.com, Dr. Bay Arinze
- █▓▓▓۩۩۩Top Hollywood Actress Angelina hot *** Scenes ۩۩۩▓▓▓█ ...., suguna
- including Crystal Filled Heart Dangle Navel Jewelry, Rainbow Gay Pride Flag Dangle Belly Ring, (www.trade8.cc), rabbitwood40@xxxxxxxxx
- Fastest and Cheapest Solution Manuals- The Solution Dr.,
studentdoctoronline@xxxxxxxxx
- <Possible follow-ups>
- Fastest and Cheapest Solution Manuals- The Solution Dr., studentdoctoronline1
- Re: Synchronization through hierarchical ordering, sum . yung . guy
- Re: Need help in the development and use JMCAD,
Yuriy
- Re: Need help in the development and use JMCAD, Yuriy
- <Possible follow-ups>
- Re: Need help in the development and use JMCAD, Yuriy
- Re: P=NP,
Jens Mander
- <Possible follow-ups>
- Re: P=NP,
valls
- Re: P=NP, Patricia Shanahan
- Re: P=NP,
Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, tchow
- Re: P=NP, valls
- Re: P=NP, tchow
- Re: P=NP, valls
- Re: P=NP, Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, curious george
- Re: P=NP, Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, tchow
- Re: P=NP, valls
- Re: P=NP, Ben Bacarisse
- Re: P=NP, Patricia Shanahan
- Re: P=NP, tchow
- Re: P=NP, curious george
- Re: P=NP, tchow
- Re: P=NP, tchow
- Re: P=NP, Ben Bacarisse
- Re: P=NP, valls
- Re: P=NP, Patricia Shanahan
- Re: P=NP, valls
- Re: P=NP, Ben Bacarisse
- Re: P=NP, valls
- Re: P=NP, Ben Bacarisse
- Re: P=NP, Joshua Cranmer
- Re: P=NP, tchow
- Re: P=NP,
zzbunker@xxxxxxxxxxxx
- Re: P=NP, javaid . nnf
- Re: P=NP, javaid . nnf
- Re: example for a real world non context free language,
rpost
- Re: example for a real world non context free language,
Florian Kaufmann
- Re: example for a real world non context free language, Jean-Marc Bourguet
- Re: example for a real world non context free language, Torben Ægidius Mogensen
- Re: example for a real world non context free language, Chris F Clark
- <Possible follow-ups>
- Re: example for a real world non context free language, Andy Walker
- Re: example for a real world non context free language,
Florian Kaufmann
