comp.theory

• Thread Index

---

• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: Integer Factorization with SAT
  • From: cplxphil
• Re: Integer Factorization with SAT
  • From: Thorsten Kiefer
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: tchow
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: Integer Factorization with SAT
  • From: cplxphil
• Re: Integer Factorization with SAT
  • From: jacko
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: tchow
• Re: Integer Factorization with SAT
  • From: Thorsten Kiefer
• Integer Factorization with SAT
  • From: Thorsten Kiefer
• Re: Hash/permutation function for object ID creation
  • From: Bruza
• Re: Hash/permutation function for object ID creation
  • From: matt . timmermans
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: Hash/permutation function for object ID creation
  • From: Kalle07
• Hash/permutation function for object ID creation
  • From: Bruza
• Software Package Free! ... about our Free Software
  • From: hpeeeter2
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: tchow
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: obvious ("dumb") question about oracles and P vs. NP
  • From: tchow
• obvious ("dumb") question about oracles and P vs. NP
  • From: cplxphil
• Re: Minimum sub-sequence sum
  • From: matt . timmermans
• just u click earn money and join life
  • From: usha
• CFP/Bursary Awards - InnovationWell Autumn Community of Practice Meeting
  • From: Robby
• Re: Minimum sub-sequence sum
  • From: Bryan Olson
• very very interesting
  • From: thepirate
• machine figure
  • From: mcjason
• expressing a working machine
  • From: mcjason
• expressed working machine
  • From: mcjason
• Re: Minimum sub-sequence sum
  • From: grpadmin
• Re: looking for old jounal "Journal of computing systems"
  • From: translogi
• Re: Minimum sub-sequence sum
  • From: Mark T.B. Carroll
• Re: Minimum sub-sequence sum
  • From: Michael Jarrod
• Re: Minimum sub-sequence sum
  • From: David Wagner
• Minimum sub-sequence sum
  • From: Michael Jarrod
• one click can change your life!!!!!!!!! you just try this ..............
  • From: shahida . shahida . banu
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• Re: describing a machine
  • From: mcjason
• describing a machine
  • From: mcjason
• way of describing a machine
  • From: mcjason
• a machine type
  • From: mcjason
• Re: Integer factorization reduction to SAT
  • From: cplxphil
• Re: Integer factorization reduction to SAT
  • From: Thorsten Kiefer
• Re: Integer factorization reduction to SAT
  • From: Thorsten Kiefer
• Re: Integer factorization reduction to SAT
  • From: Thorsten Kiefer
• crypto noob
  • From: Thorsten Kiefer
• police
  • From: kurtstocklmeir
• Integer factorization reduction to SAT
  • From: cplxphil
• moving pairs
  • From: mcjason
• Re: reducing the factorization decision problem to SAT?
  • From: Daniel A. Jimenez
• Re: reducing the factorization decision problem to SAT?
  • From: cplxphil
• Re: reducing the factorization decision problem to SAT?
  • From: PhilipJWhite
• Re: reducing the factorization decision problem to SAT?
  • From: Daniel A. Jimenez
• reducing the factorization decision problem to SAT?
  • From: cplxphil
• Re: NP problem and co-NP problem
  • From: Zhu Guohun
• Re: Rice's theorem
  • From: Chris Smith
• Re: Is this language context free?
  • From: Chris Smith
• Does the size of the stack of a PDA matter?
  • From: Dillon
• Re: Rice's theorem
  • From: Dillon
• Re: Is this language context free?
  • From: Dillon
• Re: C++ libraries pertaining to SAT
  • From: cplxphil
• Re: C++ libraries pertaining to SAT
  • From: tchow
• Re: NP problem and co-NP problem
  • From: sanchopancho80
• Re: NP problem and co-NP problem
  • From: sanchopancho80
• Re: TAUTOLOGY and SAT
  • From: cplxphil
• Re: TAUTOLOGY and SAT
  • From: Daniel A. Jimenez
• Re: Rice's theorem
  • From: Chris Smith
• Re: Is this language context free?
  • From: Chris Smith
• TAUTOLOGY and SAT
  • From: cplxphil
• Is this language context free?
  • From: Dillon
• Re: Rice's theorem
  • From: Dillon
• Re: NP problem and co-NP problem
  • From: Zhu Guohun
• Re: NP vs co-NP
  • From: Chris Smith
• NP problem and co-NP problem
  • From: sanchopancho80
• Re: NP vs co-NP
  • From: cplxphil
• C++ libraries pertaining to SAT
  • From: cplxphil
• Re: NP vs co-NP
  • From: cplxphil
• Re: Context free languages
  • From: sanchopancho80
• Re: NP vs co-NP
  • From: Fra
• Re: NP vs co-NP
  • From: cplxphil
• NP vs co-NP
  • From: sanchopancho80
• Context free languages
  • From: sanchopancho80
• Re: Recursive set
  • From: Chris F Clark
• Re: Turing computable function
  • From: sanchopancho80
• Re: Turing computable function
  • From: Chris Smith
• Re: Turing computable function
  • From: sanchopancho80
• Re: Turing computable function
  • From: Chris Smith
• Re: Turing computable function
  • From: sanchopancho80
• Re: Turing computable function
  • From: matt . timmermans
• Re: Recursive set
  • From: Chris Smith
• Turing computable function
  • From: sanchopancho80
• Re: Recursive set
  • From: Mitch
• Re: Recursive set
  • From: sanchopancho80
• Re: Recursive set
  • From: Dave Seaman
• Re: Recursive set
  • From: sanchopancho80
• Re: Recursive set
  • From: Dave Seaman
• Re: Recursive set
  • From: Mitch
• Re: Example for a non-rec.enum. language whose complement isn't rec.enum., too.
  • From: sanchopancho80
• Re: Example for a non-rec.enum. language whose complement isn't rec.enum., too.
  • From: tchow
• Re: Example for a non-rec.enum. language whose complement isn't rec.enum., too.
  • From: tchow
• Re: Example for a non-rec.enum. language whose complement isn't rec.enum., too.
  • From: Mitch
• Re: Recursive set
  • From: sanchopancho80
• Re: Recursive set
  • From: Mitch
• Example for a non-rec.enum. language whose complement isn't rec.enum., too.
  • From: sanchopancho80
• Recursive set
  • From: sanchopancho80
• Re: Definition in computation theory
  • From: sanchopancho80
• Re: Grammar for 2^i
  • From: Andy Walker
• Re: Rice's theorem
  • From: tchow
• Re: Problem with a problem
  • From: sanchopancho80
• Re: Problem with a problem
  • From: Mitch
• Re: Problem with a problem
  • From: sanchopancho80
• Re: Problem with a problem
  • From: Mitch
• Re: Rice's theorem
  • From: sanchopancho80
• Re: Problem with a problem
  • From: sanchopancho80
• Re: Rice's theorem
  • From: Mitch
• Re: Problem with a problem
  • From: Mitch
• Rice's theorem
  • From: sanchopancho80
• Re: Problem with a problem
  • From: sanchopancho80
• Re: Complexity table
  • From: sanchopancho80
• Re: Problem with a problem
  • From: Mitch
• Re: Complexity table
  • From: Mitch
• Symposium "Image Processing and Data Visualization" within the SEECCM 2009, Greece - Announce & Call for Papers
  • From: tavares@xxxxxxxx
• GI and CoNp
  • From: Notorius
• Problem with a problem
  • From: sanchopancho80
• Definition in computation theory
  • From: sanchopancho80
• Re: Complexity table
  • From: sanchopancho80
• Re: Grammar for 2^i
  • From: matt . timmermans
• Re: Turing machine and Stack
  • From: Chris Smith
• Turing machine and Stack
  • From: Andre Betz
• Re: Complexity table
  • From: Mitch
• Complexity table
  • From: sanchopancho80
• Re: Grammar for 2^i
  • From: Paul E. Black
• Re: Grammar for 2^i
  • From: Andy Walker
• Re: Grammar for 2^i
  • From: Chris Smith
• Grammar for 2^i
  • From: sanchopancho80
• CUDD
  • From: Monika
• Re: NP with oracle machines
  • From: tchow
• Re: NEXPTIME...unlimited space?
  • From: cplxphil
• Re: NP with oracle machines
  • From: cplxphil
• Re: Complexity theory
  • From: tchow
• Re: NEXPTIME...unlimited space?
  • From: tchow
• Re: NP with oracle machines
  • From: tchow
• looking for old jounal "Journal of computing systems"
  • From: translogi
• Re: NP with oracle machines
  • From: Zhu Guohun
• Re: NEXPTIME...unlimited space?
  • From: Zhu Guohun
• Re: Complexity theory
  • From: Andrea Moro
• Re: NEXPTIME...unlimited space?
  • From: Patricia Shanahan
• Re: NEXPTIME...unlimited space?
  • From: Chris F Clark
• Re: NEXPTIME...unlimited space?
  • From: cplxphil
• Re: NP with oracle machines
  • From: cplxphil
• Re: NP with oracle machines
  • From: PhilipJWhite
• Re: Complexity theory
  • From: sanchopancho80
• Re: Complexity theory
  • From: Andrea Moro
• Position: Full Professorship in Mathematical Computer Science at University of Aarhus, Denmark
  • From: Uffe Henrik Engberg
• Position: Full Professorship in Programming Languages and Formal Models at University of Aarhus, Denmark
  • From: Uffe Henrik Engberg
• Re: Complexity theory
  • From: sanchopancho80
• Re: Complexity theory
  • From: Bryan Olson
• Re: NEXPTIME...unlimited space?
  • From: Zhu Guohun
• Re: NP with oracle machines
  • From: Zhu Guohun
• Re: How many edges are there in semi cubic digraph
  • From: Zhu Guohun
• Re: Question on Sipser example proof
  • From: cplxphil
• NEXPTIME...unlimited space?
  • From: cplxphil
• Re: Diffused concern for too many papers on PvsNP
  • From: Le Chaud Lapin
• NP with oracle machines
  • From: cplxphil
• Re: How many edges are there in semi cubic digraph
  • From: Ben Bacarisse
• FCT 2009 conference known?
  • From: Johan Kwisthout
• How many edges are there in semi cubic digraph
  • From: Zhu Guohun
• Question on Sipser example proof
  • From: jackbenimble999
• Re: Word problems for grammars
  • From: sanchopancho80
• Re: Complexity theory
  • From: sanchopancho80
• Re: Complexity theory
  • From: sanchopancho80
• Re: Complexity theory
  • From: Andrea Moro
• Re: Complexity theory
  • From: Bryan Olson
• Re: P does not equal NP - a logical approach
  • From: cplxphil
• Word problems for grammars
  • From: sanchopancho80
• Re: Complexity theory
  • From: tchow
• Complexity theory
  • From: sanchopancho80
• Second CALL FOR PAPERS: WfPM'08, September 2008, Timisoara, ROMANIA
  • From: Fortis Florin
• Re: P does not equal NP - a logical approach
  • From: tchow
• Diffused concern for too many papers on PvsNP
  • From: Silvano Di Zenzo
• Re: Connection between reachability and Turing completeness
  • From: Hans Hüttel

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