comp.theory
- Probabilities in Complexity of Sequential Search Question
- From: eKo1
- passive radar theory refrence needed
- From: Peter Divos
- Re: Can we neural networks to predict code change?
- From: Stephen Harris
- Re: Can we neural networks to predict code change?
- From: Stephen Harris
- Re: Can we neural networks to predict code change?
- From: Stephen Harris
- Re: Can we neural networks to predict code change?
- From: joshipura
- Re: Can we neural networks to predict code change?
- From: Chris Smith
- Re: Can we neural networks to predict code change?
- From: tchow
- Can we neural networks to predict code change?
- From: joshipura
- Re: np-complete
- From: Babua
- Re: Which Algorithm is Faster?
- From: eKo1
- Re: np-complete
- From: CubanBoy
- Re: Analog = digital?
- From: JMF
- Re: Division by zero
- From: tchow
- Re: Division by zero
- From: Nicolas . Capens
- Re: Division by zero
- From: Nicolas . Capens
- Re: Division by zero
- From: Proginoskes
- Re: Which Algorithm is Faster?
- From: Proginoskes
- Re: pumping lemma question
- From: Chris Smith
- Re: Division by zero
- From: Patricia Shanahan
- Division by zero
- From: Nicolas . Capens
- pumping lemma question
- From: 3ashmawy
- Re: I need help with some algorithm
- From: Pawel_Iks
- Which Algorithm is Faster?
- From: eKo1
- Re: Analog = digital?
- From: tchow
- Re: I need help with some algorithm
- From: Patricia Shanahan
- I need help with some algorithm
- From: Pawel_Iks
- Re: Analog = digital?
- From: JMF
- Re: Analog = digital?
- From: tchow
- Re: Analog = digital?
- From: JMF
- Re: Analog = digital?
- From: tchow
- Analog = digital?
- From: JMF
- Re: np-complete
- From: Bryan Olson
- Re: np-complete
- From: Proginoskes
- Scheduling processor bound systems
- From: shtasik
- Call for Papers: WEA 2007
- From: camil
- np-complete
- From: CubanBoy
- References
- From: Chris Smith
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Nicholas King
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Booted Cat
- Re: Email address establishedness test
- From: Booted Cat
- Re: using non determinstic TM to prove NP is closed under kleene closure
- From: Chris Smith
- Anyone at University of Waterloo ?
- From: p . minervini
- recursively enumerable lang. closure proof morphism
- From: hkrizek@xxxxxxxxx
- CFP: WTASA 2007, Submission Deadline, Jan 23, 2007;
- From: Xiang-Yang Li
- CFP: WTASA 2007, Submission Deadline, Jan 23, 2007;
- From: Xiang-Yang Li
- Re: Minimizing length of a document
- From: Booted Cat
- Re: Minimizing length of a document
- From: Booted Cat
- AAIM 2007: Submission in 2 weeks (Dec 26th, 2006)
- From: Xiang-Yang Li
- AAIM 2007: Submission in 2 weeks (Dec 26th, 2006)
- From: Xiang-Yang Li
- Re: An easy way to prove P != NP
- From: tchow
- Re: An easy way to prove P != NP
- From: Radosław Hofman
- Re: An easy way to prove P != NP
- From: Proginoskes
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Chris F Clark
- Re: An easy way to prove P != NP
- From: tchow
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Eric Wohlstadter
- Re: An easy way to prove P != NP
- From: Russell Easterly
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Hans Aberg
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Ben Bacarisse
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Ben Bacarisse
- Types of registers
- From: Atreides
- Re: Flow Decomposition
- From: RamT
- Re: An easy way to prove P != NP
- From: Bryan Olson
- using non determinstic TM to prove NP is closed under kleene closure
- From: wbsurfver@xxxxxxxxx
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Eric Wohlstadter
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Hans Aberg
- Re: An easy way to prove P != NP
- From: Craig Feinstein
- Re: An easy way to prove P != NP
- From: tchow
- Re: An easy way to prove P != NP
- From: Patricia Shanahan
- Re: An easy way to prove P != NP
- From: Bryan Olson
- Re: Flow Decomposition
- From: Robby Goetschalckx
- Re: Question on computational complexity
- From: Proginoskes
- Re: maximal 3-colorable subset
- From: Proginoskes
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Ben Bacarisse
- Regular Tree Grammar vs. Context-Free Grammar
- From: Eric Wohlstadter
- Re: A stupid thought about Hamilton Path problem
- From: Booted Cat
- Quantum Computation By Adiabatic Evolution
- From: Or Sattath
- Re: An easy way to prove P != NP
- From: Craig Feinstein
- Flow Decomposition
- From: RamT
- Re: A stupid thought about Hamilton Path problem
- From: A . L .
- Re: A stupid thought about Hamilton Path problem
- From: Patricia Shanahan
- Re: A stupid thought about Hamilton Path problem
- From: Bryan Olson
- Re: A stupid thought about Hamilton Path problem
- From: Booted Cat
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: A stupid thought about Hamilton Path problem
- From: dfarr@xxxxxxxxxxx
- Re: Minimizing length of a document
- From: A . L .
- Re: Minimizing length of a document
- From: Booted Cat
- Re: Discussion about transformation TSP to UniqueTSP
- From: tchow
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Let programming contest kids do the research!
- From: Booted Cat
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: big-oh question
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: A stupid thought about Hamilton Path problem
- From: A . L .
- Re: A stupid thought about Hamilton Path problem
- From: Booted Cat
- Re: A stupid thought about Hamilton Path problem
- From: A . L .
- Re: A stupid thought about Hamilton Path problem
- From: Booted Cat
- Re: Discussion about transformation TSP to UniqueTSP
- From: anuj . dawar
- A stupid thought about Hamilton Path problem
- From: Booted Cat
- Re: big-oh question
- From: Patricia Shanahan
- big-oh question
- From: babyip
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: grammars and predictive parsing
- From: ledaiman
- MTU values on a network
- From: grocery_stocker
- Re: Discussion about transformation TSP to UniqueTSP
- From: tchow
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Water surface in hexahedron
- From: macio
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- ISIPTA '07 Call For Papers
- From: Alessandro Antonucci
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: Neo
- Word problem for nondeterministic BDD
- From: sasha mal
- Word problem for nondeterministic BDD
- From: sasha mal
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: tchow
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: tchow
- Re: Discussion about transformation TSP to UniqueTSP
- From: mathisart
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: Anuj Dawar
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: grammars and predictive parsing
- From: Torben Ægidius Mogensen
- Re: Discussion about transformation TSP to UniqueTSP
- From: Anuj Dawar
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radosław Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: mathisart
- Re: Discussion about transformation TSP to UniqueTSP
- From: mathisart
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: Patricia Shanahan
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: A . L .
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: Neo
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: A . L .
- grammars and predictive parsing
- From: Per Freem
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: Neo
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: tchow
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: tchow
- Re: Is there a known algorithm to solve this "playoff ranking" problem?
- From: Chris F Clark
- Re: An easy way to prove P != NP
- From: Patricia Shanahan
- Re: Is there a known algorithm to solve this "playoff ranking" problem?
- From: A.G.McDowell
- Re: Discussion about transformation TSP to UniqueTSP
- From: Anuj Dawar
- Re: Shortest Path Between Major US Cities (aka TSP)
- From: A . L .
- Shortest Path Between Major US Cities (aka TSP)
- From: Neo
- Re: Discussion about transformation TSP to UniqueTSP
- From: Patricia Shanahan
- Re: Discussion about transformation TSP to UniqueTSP
- From: tchow
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Back to Diaby's wrong algorithm; was: Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Back to Diaby's wrong algorithm; was: Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Back to Diaby's wrong algorithm; was: Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Radoslaw Hofman
- Re: grammar q
- From: Andrea Moro
- Re: Water surface in hexahedron
- From: Babua
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Water surface in hexahedron
- From: macio
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- Re: Discussion regarding Mr. Diabys algorithm
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: deepakc
- Re: Discussion about transformation TSP to UniqueTSP
- From: Bryan Olson
- grammar q
- From: Per Freem