comp.theory

Thread Index

Re: NP-Complete Definition
- From: bobbysoares
Re: Context Free language, the language empty string (lambda)
- From: Jym
Re: Context Free language, the language empty string (lambda)
- From: Chris Smith
Re: Context Free Grammer
- From: Chris Smith
Re: NP-Complete Definition
- From: tchow
Re: Grammar useless variable
- From: Rick Decker
Re: Language associated with production rule
- From: Rick Decker
Re: Context Free Grammer
- From: Rick Decker
Context Free language, the language empty string (lambda)
- From: cyberbloke
Context Free Grammer
- From: cyberbloke
Language associated with production rule
- From: cyberbloke
Grammar useless variable
- From: cyberbloke
Re: NP-Complete Definition
- From: Mitch
Re: What is the language of this grammar?
- From: Torben Ægidius Mogensen
Re: NP-Complete Definition
- From: bobbysoares
Re: NP-Complete Definition
- From: bobbysoares
Re: NP-Complete Definition
- From: tchow
NP-Complete Definition
- From: bobbysoares
Secretary Problem, Regression, Decision Trees, and Neural Networks
- From: Sarah
What is the language of this grammar?
- From: surmoi
Re: Computational complexity of cluster detection
- From: Chris Smith
Computational complexity of cluster detection
- From: vincent64@xxxxxxxxx
Fibonacci heap and Dijkstra's algorithm
- From: peter . vanna
How to split binomial heap in O(log(n))?
- From: Billy
Re: Find the type
- From: Rick Decker
Re: Find the type
- From: Rick Decker
Find the type
- From: Ravi
Re: Maximum Product Contiguous subarray
- From: Robby Goetschalckx
Maximum Product Contiguous subarray
- From: Bootlegger
Vacancy: Assistant/Associate Professor Algorithmics TUD
- From: M.M. de Weerdt
Re: Timer Implementation
- From: Chris Smith
Re: Timer Implementation
- From: Chris Smith
Touring-completeness
- From: Peter Rogers
Timer Implementation
- From: Madhur
hi.....need help in proving this plz.....
- From: hank
Re: Reducing the Knapsack Problem to the Bin Packing Problem
- From: eKo1
Re: Reducing the Knapsack Problem to the Bin Packing Problem
- From: eKo1
Re: Dynamic cycle Detection
- From: aimal . rextin
Re: Reducing the Knapsack Problem to the Bin Packing Problem
- From: eKo1
Re: Intractability Problem (reduction form 3SAT)
- From: Radoslaw Hofman
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Zhu Guohun
Re: How to prove "Cfls are not closed under shuffling"
- From: hamperhd@xxxxxxxxx
Reducing the Knapsack Problem to the Bin Packing Problem
- From: eKo1
Re: Dynamic cycle Detection
- From: David Wagner
Re: Languages are regualar
- From: 『くじょうけい』
Re: Languages are regualar
- From: 『くじょうけい』
Re: Dynamic cycle Detection
- From: busygin@xxxxxxxxx
Re: Dynamic cycle Detection
- From: Paul E. Black
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Zhu Guohun
Dynamic cycle Detection
- From: aimal . rextin
From where I can know and study AI Philosophy and its possible mathematical/biological/computational basis.
- From: Neoplato
Re: Multidimensional binary search trees
- From: mayur
Re: Languages are regualar
- From: Torben Ægidius Mogensen
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Jan
Re: Multidimensional binary search trees
- From: Babua
Languages are regualar
- From: 『⑼ⅷぅ⑩ ⅰ⑧』
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Jan
avoiding left recursion in a grammar with the production S->€
- From: xareon
Re: Multidimensional binary search trees
- From: Paul E. Black
Re: Multidimensional binary search trees
- From: Torben Ægidius Mogensen
Re: Multidimensional binary search trees
- From: kingpin
Re: 3CNF Formula
- From: meyousikmann
Re: Multidimensional binary search trees
- From: Babua
Multidimensional binary search trees
- From: kingpin
JOB: Mathematician/contractor
- From: audio . magician
Re: 3CNF Formula
- From: busygin@xxxxxxxxx
3CNF Formula
- From: meyousikmann
Re: Man beaten by machine in drawing a thumbnail
- From: Paul E. Black
Re: How to prove "Cfls are not closed under shuffling"
- From: Patricia Shanahan
Re: How to prove "Cfls are not closed under shuffling"
- From: Felipe
Re: Two-step Non-deterministic Process for Solving NP Problems
- From: Radosław Hofman
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: How to prove "Cfls are not closed under shuffling"
- From: hamperhd@xxxxxxxxx
Re: How to prove "Cfls are not closed under shuffling"
- From: filippobollini
How to prove "Cfls are not closed under shuffling"
- From: hamperhd@xxxxxxxxx
Re: Man beaten by machine in drawing a thumbnail
- From: Yao Ziyuan
Re: Man beaten by machine in drawing a thumbnail
- From: Yao Ziyuan
Man beaten by machine in drawing a thumbnail
- From: Yao Ziyuan
Re: Can this be solved in polynomial time?
- From: Leo2157
Re: Can this be solved in polynomial time?
- From: Leo2157
Hardness of this problem
- From: Scott
Re: Can this be solved in polynomial time?
- From: David Wagner
Re: Linear programming?
- From: Scott
Re: Can this be solved in polynomial time?
- From: Leo2157
Re: Can this be solved in polynomial time?
- From: David Wagner
Can this be solved in polynomial time?
- From: Leo2157
Two-step Non-deterministic Process for Solving NP Problems
- From: eKo1
Re: PSPACE closed under union
- From: Chris Smith
Re: P vs NP
- From: Radoslaw Hofman
P vs NP
- From: kooshiar
Re: PSPACE closed under union
- From: hbdere
Re: PSPACE closed under union
- From: Jym
Re: PSPACE closed under union
- From: Chris Smith
Re: PSPACE closed under union
- From: cooldavid
Re: PSPACE closed under union
- From: hbdere
Re: Category Theory of Algorithms
- From: Chris F Clark
PSPACE closed under union
- From: cooldavid
Re: Category Theory of Algorithms
- From: the.theorist
Re: superluminary particles (was: Harmonizing Quantum physics with computational physics)
- From: Paul E. Black
Re: lex yacc ???
- From: Aman
Re: lex yacc ???
- From: Chris F Clark
lex yacc ???
- From: Aman
Re: superluminary particles (was: Harmonizing Quantum physics with computational physics)
- From: Vend
Re: Linear programming?
- From: ST
Re: Linear programming?
- From: Jukka Kohonen
Re: Linear programming?
- From: Radosław Hofman
Re: Linear programming?
- From: A . L .
Linear programming?
- From: Scott
Re: Category Theory of Algorithms
- From: Jamie Andrews; real address @ bottom of message
Re: Category Theory of Algorithms
- From: Jym
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: Category Theory of Algorithms
- From: Chris F Clark
Re: Category Theory of Algorithms
- From: Mitch
Re: Category Theory of Algorithms
- From: sjr124@xxxxxxxxx
Re: is there any hint for NPC proof of the following problem?
- From: Rados?aw Hofman
Re: Category Theory of Algorithms
- From: un . student
Re: Category Theory of Algorithms
- From: the.theorist
Re: Category Theory of Algorithms
- From: the.theorist
Re: Category Theory of Algorithms
- From: Pummelo
Re: Category Theory of Algorithms
- From: Jym
Theoretical Computer Science Search Engine
- From: Geevarghese Philip
is there any hint for NPC proof of the following problem?
- From: Chao
Category Theory of Algorithms
- From: the.theorist
Re: "Size Balanced Tree" - more efficient than any known algorithm?
- From: Andrew J. Bromage
Re: "Size Balanced Tree" - more efficient than any known algorithm?
- From: godric_forever
Re: Pumping lemma. Where I go wrong?
- From: Chris Smith
Re: Pumping lemma. Where I go wrong?
- From: Ravi
Re: "Size Balanced Tree" - more efficient than any known algorithm?
- From: sqybi
Re: Pumping lemma. Where I go wrong?
- From: Chris Smith
Re: Pumping lemma. Where I go wrong?
- From: Ravi
Re: Pumping lemma. Where I go wrong?
- From: Rick Decker
Re: Pumping lemma. Where I go wrong?
- From: Ravi
Pumping lemma. Where I go wrong?
- From: Ravi
Re: Min Cut/Partitioning algorithm
- From: hbdere
JOB: Mathematician/contractor
- From: audio . magician
Re: Problem With Context Free Language Question. - Help!
- From: Coldfire
Problem With Context Free Language Question. - Help!
- From: Coldfire
Re: Could someone give me the answer for these, please
- From: A . L .
Could someone give me the answer for these, please
- From: wadupkris
Re: Min Cut/Partitioning algorithm
- From: GCRhoads
Min Cut/Partitioning algorithm
- From: hbdere
Re: My LP Formulation of the TSP: Conclusions
- From: Bryan Olson
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Zhu Guohun
Re: Kruskal and Prim with negative and positive weigths (proof)
- From: Atlas
Re: A cycle with minimum length
- From: Googmeister
Re: Kruskal and Prim with negative and positive weigths (proof)
- From: Googmeister
makes thousands of dollars lagally with a 6 dollar investment
- From: kenobis
Re: Is it possible to generate a context-free grammar for a programming language?
- From: Torben Ægidius Mogensen
Kruskal and Prim with negative and positive weigths (proof)
- From: scuffio
Re: A cycle with minimum length
- From: GCRhoads
Re: Longest path
- From: Muntasir Azam Khan