comp.theory

Thread Index

ILP formulations
- From: shrey
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Thomas A. Li
Re: Dijkstra's Paper
- From: Matthias Klaey
Dijkstra's Paper
- From: bwilde
Re: Which programmable task can be done faster by a human than by a computer?
- From: Claudio Grondi
Re: Which programmable task can be done faster by a human than by a computer?
- From: Claudio Grondi
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: RobertSzefler
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: RobertSzefler
Which programmable task can be done faster by a human than by a computer?
- From: Claudio Grondi
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: RobertSzefler
Re: Which programmable task can be done faster by a human than by a computer?
- From: x
Re: Which programmable task can be done faster by a human than by a computer?
- From: RobertSzefler
Re: Which programmable task can be done faster by a human than by a computer?
- From: Jean-Yves . Moyen
Re: Which programmable task can be done faster by a human than by a computer?
- From: RobertSzefler
syntactic congruence and myhill-nerode right invarience
- From: george
Re: switching adjacent cells on the tape
- From: Matt Timmermans
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: snowballbhb@xxxxxxxxxxxx
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: examachine
Re: switching adjacent cells on the tape
- From: Barb Knox
switching adjacent cells on the tape
- From: dumb_founded
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Keith Ramsay
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Nicholas King
Re: algebraic automata theory
- From: Jean
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Dr A. N. Walker
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Craig Feinstein
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: feeldead
Efficient algorithms for multidimensional points
- From: Lucian
Re: data structure ?
- From: aleyaroe
algebraic automata theory
- From: george
Re: Complexity of a specific kind of instances of a NP-complete problem
- From: Craig Feinstein
SPIN 2006 Call for Papers
- From: Antti Valmari
Complexity of a specific kind of instances of a NP-complete problem
- From: snowballbhb
data structure ?
- From: shrey
Re: P vs NP solved?
- From: Bryan Olson
Superset clause Elimination Algorithm in Resolution Proof
- From: Thomas A. Li
Re: What's a finite state machine?
- From: Rick Decker
Re: Big Theta, Big O examples
- From: Aaron Lint
Re: What's a finite state machine?
- From: Jamie Andrews; real address @ bottom of message
Re: What's a finite state machine?
- From: Robin Bruce
Re: Big Theta, Big O examples
- From: Nicholas King
Re: What's a finite state machine?
- From: Protoman
Big Theta, Big O examples
- From: Thanasis \(sch\)
Re: copy of some problems from Sipser Theory of Computation needed
- From: jaialai technology
copy of some problems from Sipser Theory of Computation needed
- From: jaialai technology
Re: What's a finite state machine?
- From: Robin Bruce
Re: What's a finite state machine?
- From: Rick Decker
Re: What's a finite state machine?
- From: Amit Gupta
Re: tree (graph theory problem)
- From: Michal Brzozowski
Re: What's a finite state machine?
- From: Rick Decker
Re: tree (graph theory problem)
- From: RobertSzefler
Re: tree (graph theory problem)
- From: Li Yi
Re: tree (graph theory problem)
- From: RobertSzefler
Re: tree (graph theory problem)
- From: Li Yi
tree isomorphism
- From: Li Yi
Re: tree (graph theory problem)
- From: RobertSzefler
tree (graph theory problem)
- From: Li Yi
Re: What's a finite state machine?
- From: Protoman
Re: What's a finite state machine?
- From: Rick Decker
What's a finite state machine?
- From: Protoman
Re: P vs NP solved?
- From: moustapha . diaby
Uncomputable complexity
- From: hbdere
Re: questions regarding regular grammars/finite state machine
- From: Rick Decker
questions regarding regular grammars/finite state machine
- From: Clint
Re: P vs NP solved?
- From: Bryan Olson
Re: P vs NP solved?
- From: Casey Hawthorne
Re: P vs NP solved?
- From: Casey Hawthorne
Re: P vs NP solved?
- From: moustapha . diaby
Re: P vs NP solved?
- From: moustapha . diaby
Re: Looking for an algorithm
- From: sasha mal
Re: graph theory help wanted.
- From: Amit Gupta
Looking for refs regarding regular expression minimization
- From: estrabd
Re: Petri Net question
- From: estrabd
Re: P vs NP solved?
- From: Bryan Olson
Re: P vs NP solved?
- From: moustapha . diaby
Primitive Recursive Predicate Schemas
- From: Thomas A. Li
Re: Looking for an algorithm
- From: israel
Re: Looking for an algorithm
- From: sasha mal
Re: Complexity of graph problems
- From: Michael Schnupp
graph theory help wanted.
- From: Li Yi
Re: Complexity of graph problems
- From: Mathieu Liedloff
Re: Looking for an algorithm
- From: Proginoskes
Re: Looking for an algorithm
- From: sasha mal
Re: Complexity of graph problems
- From: Michael Schnupp
Re: Complexity of graph problems
- From: Michael Schnupp
Re: Complexity of graph problems
- From: Mathieu Liedloff
min-max cut algorithms
- From: Ben
min-max cut algorithms
- From: Ben
Re: P vs NP solved?
- From: Bryan Olson
Re: Looking for an algorithm
- From: Proginoskes
Re: What is syntax and semantics in chess?
- From: Sune
Petri Net question
- From: Mayank
Complexity of graph problems
- From: Michael Schnupp
Looking for an algorithm
- From: sasha mal
Re: P vs NP solved?
- From: moustapha . diaby
Re: What is syntax and semantics in chess?
- From: Torben Ægidius Mogensen
Re: What is syntax and semantics in chess?
- From: Sune
Re: Matching in bipartite hypergraph
- From: dmitry . pavlov
Re: What is syntax and semantics in chess?
- From: Michal Brzozowski
Re: What is syntax and semantics in chess?
- From: Torben Ægidius Mogensen
What is syntax and semantics in chess?
- From: Sune
for dannel: really inviting pictures - ugme el - (1/1)
- From: eli
Matching in bipartite hypergraph
- From: dmitry . pavlov
Re: P vs NP solved?
- From: moustapha . diaby
Re: P vs NP solved?
- From: moustapha . diaby
Re: P vs NP solved?
- From: tchow
Re: P vs NP solved?
- From: Ben Rudiak-Gould
Re: Canadian Universities
- From: Paul Guertin
Re: P vs NP solved?
- From: tchow
Re: P vs NP solved?
- From: moustapha . diaby
Re: P vs NP solved?
- From: tchow
Re: P vs NP solved?
- From: Googmeister
Re: P vs NP solved?
- From: Bob Olsen
Re: P vs NP solved?
- From: Torkel Franzen
Re: P vs NP solved?
- From: tchow
Re: P vs NP solved?
- From: Bob Olsen
Re: convex hull and convex functions
- From: Amar
Re: Binary heaps
- From: Amar
Re: What does 'recursive' or 'recursively enumerable' literally mean?
- From: Amar
Re: P vs NP solved?
- From: tchow
Re: P and NP
- From: nemo
Quadratic programming problem
- From: Jean-Marc Bourguet
ECRYPT Autumn school
- From: Jesper Buus Nielsen
P vs NP solved?
- From: vor
Re: P and NP
- From: Aaron Lint
Re: Binary heaps
- From: wade