comp.theory

Thread Index

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