comp.theory

• Date Index

---

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

• Security
• UNIX
• Linux
• Coding
• Usenet

• Archive
• About
• Privacy
• Search
• Imprint

coding.derkeiler.com  > Archive  > General  > comp.theory  > 2005-09