comp.theory

Thread Index

Re: Metaphor-oriented programming
- From: Ron Hardin
Re: Longest path
- From: Pummelo
Re: Longest path
- From: Spiritus
Re: My LP Formulation of the TSP: Conclusions
- From: Nicholas King
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Metaphor-oriented programming
- From: digehode
Re: Longest path
- From: Raghu V. Hudli
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Re: RR*=R* ?
- From: j.vimal
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: Is it possible to generate a context-free grammar for a programming language?
- From: Jimmy
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: Longest path
- From: A . L .
Re: Longest path
- From: Jym
Re: Longest path
- From: Mahdi
Longest path
- From: Mahdi
Longest path
- From: Mahdi
A cycle with minimum length
- From: Mahdi
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: Is it possible to generate a context-free grammar for a programming language?
- From: Torben Ægidius Mogensen
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Is it possible to generate a context-free grammar for a programming language?
- From: Jimmy
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: Free software JFLAP alternative?
- From: Lou
Re: Free software JFLAP alternative?
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: Free software JFLAP alternative?
- From: Lou
Re: Where I can find discussion about quantum computing
- From: Nicholas King
Re: Free software JFLAP alternative?
- From: Nicholas King
Re: My LP Formulation of the TSP: Conclusions
- From: Nicholas King
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: A . L .
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: Radoslaw Hofman
Re: question on variation of subset sum problem
- From: Babua
Re: Hoare's triples question
- From: xareon
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: tchow
Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: tchow
Where I can find discussion about quantum computing
- From: Chaoji Li
Re: question on variation of subset sum problem
- From: Babua
more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: Zhu Guohun
DBPL 2007 Call for Papers
- From: marenas@xxxxxxxxxx
Re: RR*=R* ?
- From: Chris Smith
question on variation of subset sum problem
- From: amandeep.parmar@xxxxxxxxx
RR*=R* ?
- From: Ravi
Free software JFLAP alternative?
- From: Lou
Re: negative edge weights in case of Bellman-Ford algorithm
- From: NUPUL
Re: Hoare's triples question
- From: Pummelo
Re: Hoare's triples question
- From: xareon
Re: negative edge weights in case of Bellman-Ford algorithm
- From: GCRhoads
Re: My LP Formulation of the TSP: Conclusions
- From: Nicholas King
Re: My LP Formulation of the TSP: Conclusions
- From: tchow
My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
This book may appeal to some: "Computing the Continuous Discretely - Integer-Point Enumeration in Polyhedra"
- From: Casey Hawthorne
Re: My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Re: My LP Formulation of the TSP: Conclusions
- From: Patricia Shanahan
My LP Formulation of the TSP: Conclusions
- From: moustapha . diaby
Online resources for parallel algorithm design?
- From: sherifffruitfly
Re: Two challenging problems
- From: r.e.s.
Two challenging problems
- From: datashaping
negative edge weights in case of Bellman-Ford algorithm
- From: kris
Re: "compilation" and "semantics" difference between RPC and ordinary procedure call
- From: NUPUL
Re: Hoare's triples question
- From: Pummelo
Re: Hoare's triples question
- From: xareon
Re: history of generative grammars
- From: Peter Asveld
Re: history of generative grammars
- From: Allan Adler
Re: Efficient algorithm?
- From: Mitch
Re: history of generative grammars
- From: Jan Burse
Re: history of generative grammars
- From: Ron Hardin
Re: Efficient algorithm?
- From: Googmeister
Re: "compilation" and "semantics" difference between RPC and ordinary procedure call
- From: Torben Ægidius Mogensen
Efficient algorithm?
- From: Ez_Alg
Intractability Problem (reduction form 3SAT)
- From: Ez_Alg
Re: Hoare's triples question
- From: Jan
"compilation" and "semantics" difference between RPC and ordinary procedure call
- From: new_dude
Re: automatic bubble sort into quick sort?
- From: Shalin Shah
Re: 2 true/false NP complexity related questions
- From: Shalin Shah
Re: Hoare's triples question
- From: xareon
Re: help making regular expression
- From: Patricia Shanahan
Re: help making regular expression
- From: Helmut Richter
Re: 2 true/false NP complexity related questions
- From: tchow
Re: help making regular expression
- From: Torben Ægidius Mogensen
Re: help making regular expression
- From: Patricia Shanahan
theory.stanford
- From: bugzpodder
Re: help making regular expression
- From: Barb Knox
2 true/false NP complexity related questions
- From: cooldavid
Re: help making regular expression
- From: Ravi
Re: Hoare's triples question
- From: Pummelo
Re: Problem with nested for-loops
- From: r.e.s.
exercises with solutions
- From: frank
Re: help making regular expression
- From: Barb Knox
Re: help making regular expression
- From: Ravi
help making regular expression
- From: Ravi
Re: Hoare's triples question
- From: Pummelo
Re: Hoare's triples question
- From: xareon
Re: Hoare's triples question
- From: xareon
Re: Hoare's triples question
- From: Pummelo
Re: Hoare's triples question
- From: xareon
Re: Hoare's triples question
- From: Pummelo
Hoare's triples question
- From: xareon
Re: number matching
- From: PB
Re: Problem with nested for-loops
- From: un . student
Re: number matching
- From: Chris F Clark
Re: number matching
- From: Chris F Clark
Re: Help Needed....New to Data Structures
- From: pankaj_wolfhunter@xxxxxxxxxxx
Re: Help Needed....New to Data Structures
- From: Ben Pfaff
Re: Help Needed....New to Data Structures
- From: pankaj_wolfhunter@xxxxxxxxxxx
Re: Help Needed....New to Data Structures
- From: pankaj_wolfhunter@xxxxxxxxxxx
Re: Help Needed....New to Data Structures
- From: Ben Pfaff
number matching
- From: PB
Help Needed....New to Data Structures
- From: pankaj_wolfhunter@xxxxxxxxxxx
Re: linear programming
- From: A . L .
linear programming
- From: Ez_Alg
Re: automatic bubble sort into quick sort?
- From: Paul E. Black
Re: automatic bubble sort into quick sort?
- From: Torben Ægidius Mogensen
Re: show that pdas are more powerful than dpdas
- From: NUPUL
Re: Problem with nested for-loops
- From: r.e.s.
Re: Problem with nested for-loops
- From: un . student
Re: show that pdas are more powerful than dpdas
- From: xareon
show that pdas are more powerful than dpdas
- From: xareon
Question about BBP pi formula, Monte Carlo
- From: dillo
Re: automatic bubble sort into quick sort?
- From: Pummelo
Re: Problem with nested for-loops
- From: r.e.s.
Re: Problem with nested for-loops
- From: r.e.s.
Re: Problem with nested for-loops
- From: r.e.s.
Re: Problem with nested for-loops
- From: un . student
Re: Problem with nested for-loops
- From: un . student
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: tchow
Re: Which are the Ten Most Popular Languages in the World
- From: empriser
Re: Problem with nested for-loops
- From: un . student
Re: Problem with nested for-loops
- From: un . student
Re: Problem with nested for-loops
- From: Jussi Piitulainen
Problem with nested for-loops
- From: un . student
Re: Regular expression problem
- From: Patricia Shanahan
Re: Regular expression problem
- From: David Wagner
Re: automatic bubble sort into quick sort?
- From: math . idiot
Re: automatic bubble sort into quick sort?
- From: Chris Smith
automatic bubble sort into quick sort?
- From: math . idiot
Re: Regular expression problem
- From: Chris Smith
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: lingwanjae
Re: Regular expression problem
- From: Chris Smith
Graduate Math Books for sale
- From: dgiaimo@xxxxxxxxx
Re: Regular expression problem
- From: Mitch
Regular expression problem
- From: Chris Smith
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: tchow
Re: a problem on building a regular expression
- From: Jussi Piitulainen
Re: if world-wide TSP tour is solvable, then TSP can be solved in linear time
- From: Rados?aw Hofman
if world-wide TSP tour is solvable, then TSP can be solved in linear time
- From: lingwanjae
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: lingwanjae
Re: a problem on building a regular expression
- From: hamperhd@xxxxxxxxx
Re: a problem on building a regular expression
- From: Harri Haanpaa
Re: Turing Machine
- From: NathanHari@xxxxxxxxx
Re: a problem on building a regular expression
- From: NathanHari@xxxxxxxxx
Re: a problem on building a regular expression
- From: hamperhd@xxxxxxxxx
Re: a problem on building a regular expression
- From: NathanHari
Re: a problem on building a regular expression
- From: NathanHari
a problem on building a regular expression
- From: hamperhd@xxxxxxxxx
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: wade
Re: time cost to solve TSP is much less than N!
- From: Torben Ægidius Mogensen
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: ask why CONCORDE can solve TSP up to 24978 points
- From: A . L .
ask why CONCORDE can solve TSP up to 24978 points
- From: lingwanjae
Re: Diagonalization
- From: tchow
computational complexity [hard]
- From: Pummelo
Re: time cost to solve TSP is much less than N!
- From: Googmeister
Re: time cost to solve TSP is much less than N!
- From: A . L .
time cost to solve TSP is much less than N!
- From: lingwanjae
Re: Diagonalization
- From: Ben Bacarisse
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: Russell Easterly
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: Torben Ægidius Mogensen
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: Halting Problem and Read Only TM
- From: r.e.s.
Re: Halting Problem and Read Only TM
- From: Ralph Hartley
Re: Halting Problem and Read Only TM
- From: r.e.s.
Halting Problem and Read Only TM
- From: Russell Easterly
Scheduling periodic tasks without conflict
- From: Dani Camps
Re: halting problem again
- From: Jym
Re: Diagonalization
- From: tchow
Re: Diagonalization
- From: Patricia Shanahan
Re: Diagonalization
- From: oritster
Re: halting problem again
- From: rago . francesco
Re: Diagonalization
- From: meyousikmann
Re: Diagonalization
- From: Rick Decker
Re: Question about log space reductions
- From: Babua
Diagonalization
- From: meyousikmann
Re: Question about log space reductions
- From: tchow
Question about log space reductions
- From: Hatem Abdelghani
Re: Turing Machine
- From: markwh04
Re: On the General Construction for Kleene star in Context-Free Language
- From: markwh04
Re: Traveling salesman with precedences
- From: A . L .
Traveling salesman with precedences
- From: Shinchiro Izumi
Re: halting problem again
- From: Barb Knox
halting problem again
- From: mainargv