comp.theory

• Thread Index

---

• Re: [Q]: List of all possible reductions between NP problems
  • From: Bryan Olson
• Re: Induction problem ? (Atleast I think it is that :)
  • From: John Gabbriel
• [Q]: List of all possible reductions between NP problems
  • From: NPC
• Re: Induction problem ? (Atleast I think it is that :)
  • From: Vinay
• Re: Induction problem ? (Atleast I think it is that :)
  • From: RobertSzefler
• Induction problem ? (Atleast I think it is that :)
  • From: Vinay
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: Kurt Van Etten
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: tchow
• Re: dynamic programming on a tree
  • From: Paul E. Black
• Re: Graph Theory question
  • From:
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: examachine
• Re: Graph Theory question
  • From: Googmeister
• Re: Graph Theory question
  • From: John Gabbriel
• Graph Theory question
  • From: charleshowardmath
• Math Books For Sale
  • From: dgiaimo
• dynamic programming on a tree
  • From: tenida@xxxxxxxxx
• Re: multiple-string matching & regular expressions
  • From: luseng
• Generalization of Modular Arithmetic
  • From: tontoko
• Re: knapsack approximation
  • From: Thad Smith
• Re: multiple-string matching & regular expressions
  • From: A.G.McDowell
• Re: project management: scheduling of tasks
  • From: Francis Sourd
• multiple-string matching & regular expressions
  • From: luseng
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: Ralph Hartley
• project management: scheduling of tasks
  • From: barth_no_spam
• Re: graph layout algorithm
  • From: Gene
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: tchow
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: tchow
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: Ralph Hartley
• Re: graph layout algorithm
  • From: Jean-Marc Bourguet
• Re: graph layout algorithm
  • From: Joachim Pimiskern
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: examachine
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: tchow
• graph layout algorithm
  • From: enigma261
• Re: Another clueless wikipedia article
  • From: Simon G Best
• CFP: IAENG International Workshop on Computer Science (in IMECS 2006)
  • From: imecs2006
• Re: Another clueless wikipedia article
  • From: examachine
• Re: Another clueless wikipedia article
  • From: Simon G Best
• Re: Another clueless wikipedia article
  • From: examachine
• Re: Another clueless wikipedia article
  • From: Simon G Best
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: examachine
• Re: Another clueless wikipedia article
  • From: examachine
• Re: Another clueless wikipedia article
  • From: examachine
• Re: Another clueless wikipedia article
  • From: Simon G Best
• Re: Another clueless wikipedia article
  • From: Ben Rudiak-Gould
• Re: Significance of "Relativizations of the P =? NP Question"
  • From: tchow
• Re: Where's the FAQ?
  • From: Simon G Best
• Re: Another clueless wikipedia article
  • From: examachine
• Another clueless wikipedia article
  • From: examachine
• Significance of "Relativizations of the P =? NP Question"
  • From: examachine
• Re: Where's the FAQ?
  • From: Daniel A. Jimenez
• Where's the FAQ?
  • From: Simon G Best
• Re: Subset Sum Problem
  • From: JeffCameron
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Information Required
  • From: globalinfoshare
• Re: Is there an EXPSPACE complete language?
  • From: tchow
• Re: Looking for a fast algorithm
  • From: wade
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Re: Hamiltonian Cycles algorithm
  • From: Googmeister
• Re: Hamiltonian Cycles algorithm
  • From: tchow
• REMINDER -- FACS/FME Seminar: Formal Methods in the Last 25 Years, 30 January, 5.30pm, London
  • From: FACS FACTS Editor
• Re: Hamiltonian Cycles algorithm
  • From: Doni Ocena
• Re: Hamiltonian Cycles algorithm
  • From: Joachim Pimiskern
• Re: Hamiltonian Cycles algorithm
  • From: Hans-Christoph Wirth
• Finite function analysis and manipulation
  • From: acd
• Re: Hamiltonian Cycles algorithm
  • From: alex05
• Re: Hamiltonian Cycles algorithm
  • From: Joachim Pimiskern
• Hamiltonian Cycles algorithm
  • From: alex05
• Re: Help!! Random Integer Generator Algorithm
  • From: Robin Bruce
• Re: Help!! Random Integer Generator Algorithm
  • From: Paul E. Black
• Help!! Random Integer Generator Algorithm
  • From: Klein
• Re: Looking for a fast algorithm
  • From: Ben Rudiak-Gould
• Looking for a fast algorithm
  • From: frederik_coppens
• Matching problem
  • From: mattias
• Re: TSP Path: NOT Tour
  • From: Nicholas King
• TSP Path: NOT Tour
  • From: yangshengwen
• Re: Subset Sum Problem
  • From: Googmeister
• Subset Sum Problem
  • From: JeffCameron
• Re: 120,510,132 truth tables generated by 3-CNF of five variables [ttcnf]
  • From: Samuel Hornus
• Complexity of NFA
  • From: andywx
• Genus reduction of a triangular mesh
  • From: luca regini
• Find the center of unicyclic graph
  • From: Wilma
• 3D viewer at work
  • From: liska273
• Re: P-Time Circuit SAT
  • From: Enrico Dirac
• Re: Need help with terminology
  • From: Jamie Andrews; real address @ bottom of message
• Re: P-Time Circuit SAT
  • From: klaus hoffmann
• Minimal transducer that maps one word into another
  • From: max
• Re: Do all state transition functions require state transition matrixes?
  • From: markwh04
• Re: Finite & Infinite State Machines (was: Finite State Machine)
  • From: markwh04
• Do all state transition functions require state transition matrixes?
  • From: Peter Olcott
• Re: Is there an EXPSPACE complete language?
  • From: tchow
• Re: N-Block Tetris Shapes
  • From: Robby Goetschalckx
• Re: Algorithm transformation
  • From: Jym
• Re: Which programming language to choose : Challenge for real experts here !
  • From: rengolin
• Re: Which programming language to choose : Challenge for real experts here !
  • From: rengolin
• Re: Which programming language to choose : Challenge for real experts here !
  • From: rengolin
• N-Block Tetris Shapes
  • From: yaoziyuan
• P-Time Circuit SAT
  • From: Enrico Dirac
• N-Block Tetris Shapes
  • From: yaoziyuan
• N-Block Tetris Shapes
  • From: yaoziyuan
• N-Block Tetris Shapes
  • From: yaoziyuan
• Re: Finite & Infinite State Machines (was: Finite State Machine)
  • From: tmp123
• Re: Finite & Infinite State Machines (was: Finite State Machine)
  • From: Peter Olcott
• Re: Need help with terminology
  • From: tchow
• Algorithm transformation
  • From: tmp123
• CFP: Special Issue on Bioinformatics (The journal Engineering Letters)
  • From: imecs__2006
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Michael J. Fromberger
• Finite & Infinite State Machines (was: Finite State Machine)
  • From: markwh04
• Re: Turing machines when several strings
  • From: tmp123
• Re: Turing machines when several strings
  • From: tmp123
• Re: Need help with terminology
  • From: Peter Olcott
• Re: Need help with terminology
  • From: Rick Decker
• Re: Need help with terminology
  • From: Peter Olcott
• Re: Need help with terminology
  • From: Ben Rudiak-Gould
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Need help with terminology
  • From: Peter Olcott
• Re: Which programming language to choose : Challenge for real experts here !
  • From: Morgan
• Finite State Machine
  • From: Peter Olcott
• Re: Turing machines when several strings
  • From: Jym
• Turing machines when several strings
  • From: tmp123
• Re: Which programming language to choose : Challenge for real experts here !
  • From: pailleg
• Re: Which programming language to choose : Challenge for real experts here !
  • From: RobertSzefler
• Re: Which programming language to choose : Challenge for real experts here !
  • From: Morgan
• Proofs of Reinforcement Learning Algorithms
  • From: kartoun
• Re: Is there an EXPSPACE complete language?
  • From: tchow
• State Transition Functions
  • From: Peter Olcott
• Context-Free Expressions and Turing Expressions (was: Context Free Language)
  • From: markwh04
• Re: How about graph power
  • From: LLI
• Which programming language to choose : Challenge for real experts here !
  • From: pailleg
• Re: How about graph power
  • From: Googmeister
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Morgan Cheng
• Speedup theorem's example in the theoretical language GOTO
  • From: Iseneth
• Re: How about graph power
  • From: klaus hoffmann
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Re: Is there an EXPSPACE complete language?
  • From: tchow
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• How about graph power
  • From: LLI
• Re: Is there an EXPSPACE complete language?
  • From: tchow
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Zig
• Re: How to traverse Binary Tree with constant space, without ...
  • From: Dirk Thierbach
• Re: Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Is there an EXPSPACE complete language?
  • From: rani_sharoni
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Gene
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Zig
• Re: How to traverse Binary Tree with constant space, without modifiying the tree and in O(n) time
  • From: Matt Timmermans

We are proud to have Web Hosting and Rack Housing from 9 Net Avenue Deutschland.
(14)