comp.theory

Thread Index

Folk computer science and soap bubbles
- From: examachine
Re: The Steiner Tree Problem
- From: Bart Demoen
The Steiner Tree Problem
- From: Bob
Re: P=NP: Linear Programming Formulation of the TSP
- From: David Moews
Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
Re: P=NP: Linear Programming Formulation of the TSP
- From: Mitch Harris
Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
Re: "A Proof Of NP not equal P"
- From: examachine
AOA(AON) network representation
- From: Mustafa Ege
Re: P=NP: Linear Programming Formulation of the TSP
- From: Mitch Harris
Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: "A Proof Of NP not equal P"
- From: Mark
Re: Any solution to this problem?
- From: Martin Fuchs
Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
Re: Any solution to this problem?
- From: Burt Price
Re: n edges shortest path
- From: Per Vognsen
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
Re: n edges shortest path
- From: Michal Brzozowski
Re: optimized string storage for phrases/dictionary
- From: Jamie Andrews; real address @ bottom of message
Re: Time Dependent Shortest Path
- From: Keith Ramsay
Re: "A Proof Of NP not equal P"
- From: jarfo
Re: Reply: Time dependent shortest path
- From: wade
Re: Any solution to this problem?
- From: Martin Fuchs
Any solution to this problem?
- From: Burt Price
Reply: Time dependent shortest path
- From: chenyan
Re: optimized string storage for phrases/dictionary
- From: Nameless
Re: discuss dancing links
- From: gcrhoads@xxxxxxxxx
Re: n edges shortest path
- From: samipate
n edges shortest path
- From: samipate
Re: overall-longest-possible-path problem
- From: tchow
Re: Time Dependent Shortest Path
- From: Shaddin Doghmi
Re: overall-longest-possible-path problem
- From: Shaddin Doghmi
interesting graph question- need some help..
- From: kiwi
Time Dependent Shortest Path
- From: chenyan
Re: optimized string storage for phrases/dictionary
- From: Paul E. Black
Re: discuss dancing links
- From: chenyan
optimized string storage for phrases/dictionary
- From: dagny_orearden
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: Yajun
Re: P=NP: Linear Programming Formulation of the TSP
- From: Mike Robson
Re: discuss dancing links
- From: Roberto Bagnara
Re: discuss dancing links
- From: Nimish Shah
Re: discuss dancing links
- From: gcrhoads@xxxxxxxxx
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: Yajun
Re: overall-longest-possible-path problem
- From: tchow
Re: overall-longest-possible-path problem
- From: Shaddin Doghmi
Re: P=NP: Linear Programming Formulation of the TSP
- From: jarfo
Re: Not constructive proof of existing of an algorithm
- From: Iron Bone
Re: Not constructive proof of existing of an algorithm
- From: Roberto Bagnara
Re: P=NP: Linear Programming Formulation of the TSP
- From: A . L .
What's This Model of Computing Called?
- From: Simon G Best
OT: Keyboard science
- From: skearney
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: A . L .
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: P=NP: Linear Programming Formulation of the TSP
- From: A . L .
Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
Re: Problems in NP with infinite number of possibiltiies to check?
- From: tchow
Re: Problems in NP with infinite number of possibiltiies to check?
- From: Patricia Shanahan
Re: Problems in NP with infinite number of possibiltiies to check?
- From: jarfo
Problems in NP with infinite number of possibiltiies to check?
- From: Richard Hayden
Re: P=NP: Linear Programming Formulation of the TSP
- From: jarfo
Re: Not constructive proof of existing of an algorithm
- From: tchow
overall-longest-possible-path problem
- From: Alexander Landa
Re: Not constructive proof of existing of an algorithm
- From: Yajun
Re: Not constructive proof of existing of an algorithm
- From: Christian Kleinewaechter
Re: Not constructive proof of existing of an algorithm
- From: Yajun
Re: compression algorithm is NP complete problem?
- From: Barb Knox
Re: compression algorithm is NP complete problem?
- From: Mauricio Nivaldo Andres Monsalve Moreno
Re: Satisfiability problem compiler
- From: tchow
Re: How to evaluate the hardness of a Multiobjective Optimization problem?
- From: Ying-Chun Liu
Re: Not constructive proof of existing of an algorithm
- From: Mike Robson
Re: Not constructive proof of existing of an algorithm
- From: googmeister
Not constructive proof of existing of an algorithm
- From: Iron Bone
Re: Satisfiability problem compiler
- From: Kerry Soileau
Re: Satisfiability problem compiler
- From: Matt Timmermans
Re: little-steps giant-steps
- From: Craig Feinstein
little-steps giant-steps
- From: Craig Feinstein
Satisfiability problem compiler
- From: Kerry Soileau
How to evaluate the hardness of a Multiobjective Optimization problem?
- From: saisai
In want know about one algorithm (k-node) and how to converted distributed algorithm for link failure?.
- From: rdelhibabu
Network Flow
- From: rambotrout
Re: Computational Mathematics and Computer Science
- From: Rick Decker
Re: Computational Mathematics and Computer Science
- From: gcrhoads@xxxxxxxxx
finding a maximum in a matrix
- From: Jean Cardinal
Computational Mathematics and Computer Science
- From: LonesomeToo
Re: compression algorithm is NP complete problem?
- From: Denis Flex
Re: compression algorithm is NP complete problem?
- From: Torben Ægidius Mogensen
compression algorithm is NP complete problem?
- From: jrefactors
Re: What computing is all about
- From: Andrew
FPTAS
- From: jumpstart
Perfecting Google's Rankings: A Collaborative Ranking Experiment
- From: Amir Michail
Pv.NP
- From: HoOrus@xxxxxxxxx
Marie Curie PhD positions: Machine Learning for Bioinformatics
- From: Paolo Frasconi
Re: 'Super Turing Machines'
- From: examachine
QoS Routing for Supporting Multimedia Applications
- From: jumpstart
Re: Three exercises from Nielsen and Chuang
- From: Paul E. Black
In want know about one algorithm (k-node) and how to converted distributed algorithm for link failure?.
- From: rdelhibabu
graph coloring, implementation
- From: plize
Re: clustering adjacency matrix (binary vectors of 1/0)
- From: Michael Weitzel
interleaving
- From: Bodzio
Re: 'Super Turing Machines'
- From: Stephen Harris
Final CFP: 7th Intl Workshop on Logic & Computational Complexity
- From: Jim Royer
Last call for papers CAAN 2005
- From: Alex Lopez-Ortiz
Re: Subset sum problem
- From: Torben Ægidius Mogensen
Subset sum problem
- From: John P. Green
clustering adjacency matrix (binary vectors of 1/0)
- From: les_ander
Discuss algorithm for dominating k-set
- From: Joe
Re: Quantum Computation
- From: Ralph Hartley
Re: 'Super Turing Machines'
- From: Richard Hayden
Re: Point location
- From: Thomas Heinz
Multidimensional rectangle partition
- From: Thomas Heinz
Nondeterministic linear-time multiplication?
- From: John Harrison
Re: 'Super Turing Machines'
- From: Stephen Harris
Re: NP - Hard
- From: examachine
Re: Quantum Computation
- From: Mark
Re: NP - Hard
- From: jumpstart
randomized algorithms for np-complete problems
- From: Craig Feinstein
Re: NP - Hard
- From: Michael N. Christoff
PhD position in Algorithms
- From: fredrikm
Vacant postdoc in Algorithms/Combinatorial optimization
- From: fredrikm
Re: NP - Hard
- From: examachine
finding maximal equivalence under given relation
- From: Ivan Kopecek
Lectureship in Algorithms, University of Leicester
- From: T. Erlebach
Re: NP - Hard
- From: Michael N. Christoff
Re: NP - Hard
- From: jumpstart
Re: NP - Hard
- From: Jon Haugsand
Announcing CLAIR 1.0
- From: Roberto Bagnara
Re: NP - Hard
- From: Daniel A. Jimenez
Re: NP - Hard
- From: Jon Haugsand
Re: NP - Hard
- From: jumpstart
Re: NP - Hard
- From: Michael N. Christoff
Re: NP - Hard
- From: jumpstart
Re: NP - Hard
- From: Iron Bone
Re: "A Proof Of NP not equal P"
- From: examachine
NP - Hard
- From: jumpstart
Approximation algorithms
- From: jumpstart
Re: "A Proof Of NP not equal P"
- From: Russell Easterly
Re: "A Proof Of NP not equal P"
- From: examachine
Network Reliability
- From: Nawa Ng.
'Super Turing Machines'
- From: Richard Hayden
Re: Artificial Intelligence
- From: Stephen Harris
Re: Digraph algorithm
- From: Matt Timmermans
Re: Artificial Intelligence
- From: Mark Carroll
Re: Digraph algorithm
- From: gcrhoads@xxxxxxxxx
Artificial Intelligence
- From: Mutley
Digraph algorithm
- From: Mark Carroll
Searching for Distribution Ideas
- From: PipedreamerGrey