comp.theory
- TSP and A-star,
kingpin
- Re: TSP and A-star, wade
- context free languages under SCRAMBLE operation, TheGist
- is {ww^Rw | w in {0,1}*} context free?,
rabbits77
- Re: is {ww^Rw | w in {0,1}*} context free?, Barb Knox
- Dual of MVE, HardWorkingGuy
- PhD position within algorithmic game theory, Peter Bro Miltersen
- Postdoc positions within algorithmic game theory, Peter Bro Miltersen
- Call for Participation: BCTCS 2007, Sharon
- a^p, p is prime, j . vimal
- representation of monotone boolean functions, sasha mal
- Hardness results for queries with preprocessing, sasha mal
- Union of sets in O(N),
tomerdr
- Re: Union of sets in O(N),
Torben Ægidius Mogensen
- Re: Union of sets in O(N), tomerdr
- Re: Union of sets in O(N),
Torben Ægidius Mogensen
- Optimal generalization of Montgomery's trick, mega_bit8
- need help developin better sense for context free languages,
TheGist
- Re: need help developin better sense for context free languages,
Mitch
- Re: need help developin better sense for context free languages,
Torben Ægidius Mogensen
- Re: need help developin better sense for context free languages, Chris F Clark
- Re: need help developin better sense for context free languages, Patricia Shanahan
- Re: need help developin better sense for context free languages, Chris F Clark
- Re: need help developin better sense for context free languages, Patricia Shanahan
- Re: need help developin better sense for context free languages,
Torben Ægidius Mogensen
- Re: need help developin better sense for context free languages,
Mitch
- need help finding a class project(comp. geometry and cryptography), forums
- Proof of Uncomputability of Kolmogorov complexity, asdf
- attn: cletus - highly successful nntp server - an ugce ub - (1/1), selby
- One year MS/MSc course in Informatics at Edinburgh University, Bob Fisher
- DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3},
meyousikmann
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3}, Barb Knox
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3}, Patricia Shanahan
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3},
Torben Ægidius Mogensen
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3},
Patricia Shanahan
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3}, Torben Ægidius Mogensen
- Re: DFA recognizing the language {w | top(w) mod 3 = bottom(w) mod 3},
Patricia Shanahan
- Graduate Level Math Books For Sale, dgiaimo
- The Perfect Machine,
newstips6706
- Re: The Perfect Machine, Barb Knox
- Diagonalization theorem,
iAGENT
- Re: Diagonalization theorem, Patricia Shanahan
- Re: Diagonalization theorem, Patricia Shanahan
- which algorithm to use for this task?, smekla
- WEA 2007 Extended Deadline, camil
- help on constructing a tree with a mixed criterion, Yecloud
- Final call for papers: Multi-conference, john
- Microsoft Interview Questions,
kool_guy
- Re: Microsoft Interview Questions,
Googmeister
- Re: Microsoft Interview Questions, new_dude
- Re: Microsoft Interview Questions, stdazi@xxxxxxxxx
- Re: Microsoft Interview Questions,
stdazi@xxxxxxxxx
- Re: Microsoft Interview Questions,
Patricia Shanahan
- Re: Microsoft Interview Questions, stdazi@xxxxxxxxx
- Re: Microsoft Interview Questions, Patricia Shanahan
- Re: Microsoft Interview Questions, Bryan Olson
- Re: Microsoft Interview Questions,
Patricia Shanahan
- Re: Microsoft Interview Questions,
Chris Smith
- Re: Microsoft Interview Questions,
Ben Pfaff
- Re: Microsoft Interview Questions, Chris Smith
- Re: Microsoft Interview Questions,
Le Chaud Lapin
- Re: Microsoft Interview Questions, Ben Pfaff
- Re: Microsoft Interview Questions, Le Chaud Lapin
- Re: Microsoft Interview Questions, Bryan Olson
- Re: Microsoft Interview Questions, Chris F Clark
- Re: Microsoft Interview Questions,
Ben Pfaff
- Re: Microsoft Interview Questions,
eKo1
- Re: Microsoft Interview Questions, Patricia Shanahan
- Re: Microsoft Interview Questions, Proginoskes
- Re: Microsoft Interview Questions,
Googmeister
- Graph Coloring,
Abid
- Re: Graph Coloring, tchow
- Re: Graph Coloring, Ben Bacarisse
- Re: Graph Coloring,
Torben Ægidius Mogensen
- Re: Graph Coloring,
Abid
- Re: Graph Coloring, Proginoskes
- Re: Graph Coloring, tchow
- Re: Graph Coloring, tchow
- Re: Graph Coloring, Proginoskes
- Re: Graph Coloring, tchow
- Re: Graph Coloring, Abid
- Re: Graph Coloring, Patricia Shanahan
- Re: Graph Coloring, tchow
- Re: Graph Coloring, Abid
- Re: Graph Coloring, tchow
- Re: Graph Coloring, Abid
- Re: Graph Coloring,
Abid
- convex hulls,
Rij
- Re: convex hulls, Mladen Srdic
- Re: convex hulls, tchow
- Group introductions problem,
Paul E. Black
- Re: Group introductions problem, A.G.McDowell
- Re: hello guys.....about network flow formulation problem, A . L .
- A Exam related question plz help,
navzit
- Re: A Exam related question plz help, Chris Smith
- trying to use the pumping lemma,
TheGist
- Re: trying to use the pumping lemma, Rick Decker
- question on proving a language is regular,
TheGist
- Re: question on proving a language is regular,
Chris Smith
- Re: question on proving a language is regular,
Torben Ægidius Mogensen
- Re: question on proving a language is regular, TheGist
- Re: question on proving a language is regular, Chris Smith
- Re: question on proving a language is regular,
Torben Ægidius Mogensen
- Re: question on proving a language is regular,
Chris Smith
- a DFA for the language L={w in {0,1}*|w does not contain the substring 001},
jaialai technology
- Re: a DFA for the language L={w in {0,1}*|w does not contain the substring 001}, Proginoskes
- Re: a DFA for the language L={w in {0,1}*|w does not contain the substring 001},
Torben Ægidius Mogensen
- Re: a DFA for the language L={w in {0,1}*|w does not contain the substring 001},
Patricia Shanahan
- Re: a DFA for the language L={w in {0,1}*|w does not contain the substring 001}, Torben Ægidius Mogensen
- Re: a DFA for the language L={w in {0,1}*|w does not contain the substring 001},
Patricia Shanahan
- Silly question-Please answer quickly, babu
- CALL FOR PAPERS: International Workshop on Theoretical and Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA'07),
Xiang-Yang Li
- <Possible follow-ups>
- CALL FOR PAPERS: International Workshop on Theoretical and Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA'07), Xiang-Yang Li
- anyone here recommend Skiena's The Algorithm Design Manual?,
TheGist
- Message not available
- Re: anyone here recommend Skiena's The Algorithm Design Manual?, user923005
- Hofman and Diaby talk about P=NP at INFORMS 2007,
dmoews
- 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,
Radoslaw Hofman
- 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, 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, 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, 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, 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, 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, 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, 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,
Radoslaw Hofman
- Maximal DAG within a graph?,
Cameron McCormack
- Re: Maximal DAG within a graph?,
Proginoskes
- Re: Maximal DAG within a graph?, Cameron McCormack
- Re: Maximal DAG within a graph?,
Proginoskes
- Can anyone explain this "job offer" puzzle?, anon
- Quantum computable functions,
Chris Smith
- Re: Quantum computable functions,
dmoews
- Re: Quantum computable functions, Chris Smith
- Re: Quantum computable functions, Stephen Harris
- Re: Quantum computable functions,
dmoews
- is the language of regular expressions a regular language?, TheGist
- Replicating the memory tape in neumanns universal constructor, Andre Betz
- time complexity of algorithm question:, tomerdr
- Please recommend book about Algorithms and Complexity, tomerdr
- need help.trying to brush up on finite automata for the spring quals, jaialai technology
- Universal Constructor in Conways game of life?,
Andre Betz
- Re: Universal Constructor in Conways game of life?, Torben Ægidius Mogensen
- Re: Can we neural networks to predict code change?,
Ehsan
- Re: Can we neural networks to predict code change?, Chris Smith
- <Possible follow-ups>
- Re: Can we neural networks to predict code change?, Ehsan
- Re: Can we neural networks to predict code change?, Ehsan
- Re: Can we neural networks to predict code change?, Ehsan
- Re: Division by zero,
Grisinger
- Re: Division by zero,
Nicolas . Capens
- Re: Division by zero, Grisinger
- <Possible follow-ups>
- Re: Division by zero, Nicolas . Capens
- Re: Division by zero,
Nicolas . Capens
- what is the complexity of Hamiltonian problem on 2-regular digraph,
Zhu Guohun
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Proginoskes
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph,
Jan
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph,
Zhu Guohun
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Proginoskes
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Zhu Guohun
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Jan
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Zhu Guohun
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Jan
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Jan
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, Zhu Guohun
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph, A . L .
- Re: what is the complexity of Hamiltonian problem on 2-regular digraph,
Zhu Guohun
- A new thread for a question of my view from Mr. Sergey Gubin, Zhu Guohun
- Multiply Linear Polynomials,
Debula
- Re: Multiply Linear Polynomials, Barb Knox
- Re: Multiply Linear Polynomials,
Nicolas . Capens
- Re: Multiply Linear Polynomials,
A . L .
- Re: Multiply Linear Polynomials, Nicolas . Capens
- Re: Multiply Linear Polynomials, A . L .
- Re: Multiply Linear Polynomials, Nicolas . Capens
- Re: Multiply Linear Polynomials, A . L .
- Re: Multiply Linear Polynomials, Nicholas King
- Re: Multiply Linear Polynomials, Debula
- Re: Multiply Linear Polynomials,
A . L .
- Re: Multiply Linear Polynomials,
Debula
- Re: Multiply Linear Polynomials,
A . L .
- Re: Multiply Linear Polynomials, Debula
- Re: Multiply Linear Polynomials,
A . L .
- Re: Multiply Linear Polynomials, Jym
- Re: Multiply Linear Polynomials, Debula
- Re: Multiply Linear Polynomials, A . L .
- Re: Multiply Linear Polynomials, A . L .
- Re: Multiply Linear Polynomials, Chris Smith
- Re: Multiply Linear Polynomials, Jym
- Re: Multiply Linear Polynomials, A . L .
- Re: Multiply Linear Polynomials, Jym
- Re: Multiply Linear Polynomials,
A . L .
- "Size Balanced Tree" - more efficient than any known algorithm?,
Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?,
A . L .
- Re: "Size Balanced Tree" - more efficient than any known algorithm?,
Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Message not available
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, A . L .
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, sillybanter
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, sillybanter
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Message not available
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Edward M. Reingold
- Message not available
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Edward M. Reingold
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, A . L .
- Re: "Size Balanced Tree" - more efficient than any known algorithm?,
Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?,
A . L .
- Message not available
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, sillybanter
- Message not available
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, A . L .
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, A . L .
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Booted Cat
- Re: "Size Balanced Tree" - more efficient than any known algorithm?, Jamie Andrews; real address @ bottom of message
- Re: A DTM to reverse a bit string,
Ben Bacarisse
- Re: A DTM to reverse a bit string,
Debula
- Re: A DTM to reverse a bit string, Chris Smith
- Re: A DTM to reverse a bit string, Debula
- Re: A DTM to reverse a bit string, Ben Bacarisse
- Re: A DTM to reverse a bit string, sasha mal
- Re: A DTM to reverse a bit string,
Debula
