comp.theory
- Shortest Path,
Ez_Alg
- halting problem I've got more questions,
mainargv
- revisit halting problem,
mainargv
- An efficient way of sequencing streams of integers,
Chris
- Turing Machine,
meyousikmann
- reinforcement learning,
Thorsten Kiefer
- Re: "Size Balanced Tree" - more efficient than any known algorithm?,
sqybi
- On the General Construction for Kleene star in Context-Free Language,
Federico Magallanez
- A restricted case of graph coloring, is this a known problem?,
Chris F Clark
- CEX - Context-Free Expression Filter,
markwh04
- Worst-case Performance of Insertion Sort,
eKo1
- Doubt,
rajababu . m1
- language theory regarding Perl/Ruby in universities ?,
surfivor
- OGR to SAT,
Thorsten Kiefer
- THEOREM: I <= 4M in GF(p^n),
mega_bit8
- E=mc2 and British Nobel Laureate Frederick Soddi,
sciencecool@xxxxxxxxxxx
- CALL FOR PAPERS: International Workshop on Theoretical and Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA'07),
Xiang-Yang Li
- Point location in a grid.,
Amit Bhatia
- Questions about quantum complexity theory.,
Hatem Abdelghani
- help with interview question,
new_dude
- attn: kaitlin - peaceful news server access - nolno ik - (1/1),
stephanus
- Errors in Papademetriou?,
Hatem Abdelghani
- Average-case analysis of Hopcroft's DFA minimization algorithm?,
Sheldon Nicholl
- Graduate Level Math Books (still) For Sale,
dgiaimo
- Relation problem for homework,
navzit
- Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
Paul E. Black
- Re: Do Write Once TM's Halt?,
TheGist
- Message not available
- Re: Do Write Once TM's Halt?,
r.e.s.
- Re: Do Write Once TM's Halt?,
Patricia Shanahan
- Re: Do Write Once TM's Halt?,
r.e.s.
- Re: Do Write Once TM's Halt?,
r.e.s.
- Re: Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
r.e.s.
- Re: Do Write Once TM's Halt?,
Chris Smith
- Re: Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?,
Patricia Shanahan
- Re: Do Write Once TM's Halt?,
Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?,
Russell Easterly
- Re: Do Write Once TM's Halt?,
Dr A. N. Walker
Compendium for Counting Hierarchy (CH) complete problems,
Johan Kwisthout
Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Chris Smith
- Re: Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Chris Smith
- Re: Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Chris Smith
- Re: Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Chris Smith
- Re: Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Chris Smith
- Re: Some simple undecidable languages questions.,
Torben Ægidius Mogensen
- Re: Some simple undecidable languages questions.,
cooldavid
- Re: Some simple undecidable languages questions.,
Torben Ægidius Mogensen
[DFA] Proof that ...,
muede
List of accepted papers for CCC'07,
Peter Bro Miltersen
Pumping Lemma,
meyousikmann
Exclusive-Or used to memorize an infinite list of numbers,
linuxguru1968
Re: An UnSat Solver,
Russell Easterly
is this language recursively enumerable?,
jaialai technology
O(n) Parsing For General Context-Free Grammars & Transductions,
markwh04
division by 7efficiently,
krypto . wizard
quick algorithm for random permutation,
John
Re: a^p, p is prime,
Torben Ægidius Mogensen
transfer time complex algorithm to space complex(in TSP example),
lingwanjae
regexp for reg language that has an even number of a's and b's,
jaialai technology
Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radosław Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Nicholas King
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Contesting machine checked proofs (was Hofman/Diaby 'debate'),
Mitch
- Re: Contesting machine checked proofs (was Hofman/Diaby 'debate'),
Radoslaw Hofman
- Re: Contesting machine checked proofs (was Hofman/Diaby 'debate'),
tchow
- Re: Contesting machine checked proofs (was Hofman/Diaby 'debate'),
A . L .
- Re: Contesting machine checked proofs (was Hofman/Diaby 'debate'),
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Message not available
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
A . L .
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radosław Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Nicholas King
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Patricia Shanahan
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Jamie Andrews; real address @ bottom of message
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radosław Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
kingpin
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Nicholas King
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
moustapha . diaby
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
- Message not available
- Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Radoslaw Hofman
Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
tchow
<Possible follow-ups>
Re: Hofman and Diaby talk about P=NP at INFORMS 2007,
Nicholas King
