comp.theory

• Date Index

---

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

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