comp.theory

Thread Index

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