comp.theory

• Thread Index

---

• Re: Is there a known algorithm to solve this "playoff ranking" problem?
  • From: Proginoskes
• First Call for Papers: Unconventional Computation 2007
  • From: uc . secretary
• Re: Is there a known algorithm to solve this "playoff ranking" problem?
  • From: Chris F Clark
• Re: Discussion about transformation TSP to UniqueTSP
  • From: mathisart
• Re: Discussion about transformation TSP to UniqueTSP
  • From: tchow
• Re: Discussion about transformation TSP to UniqueTSP
  • From: tchow
• Re: Discussion about transformation TSP to UniqueTSP
  • From: tchow
• Re: Water surface in hexahedron
  • From: Paul E. Black
• Re: Water surface in hexahedron
  • From: Patricia Shanahan
• Re: Question on computational complexity
  • From: Artyom
• Re: Discussion about transformation TSP to UniqueTSP
  • From: tchow
• Re: Water surface in hexahedron
  • From: macio
• Re: Discussion about transformation TSP to UniqueTSP
  • From: Radoslaw Hofman
• Re: Discussion about transformation TSP to UniqueTSP
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion about transformation TSP to UniqueTSP
  • From: deepakc
• Re: Discussion about transformation TSP to UniqueTSP
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion about transformation TSP to UniqueTSP
  • From: deepakc
• Re: Discussion about transformation TSP to UniqueTSP
  • From: Radoslaw Hofman
• Re: Discussion about transformation TSP to UniqueTSP
  • From: Radoslaw Hofman
• Re: Is there a known algorithm to solve this "playoff ranking" problem?
  • From: Proginoskes
• Re: An easy way to prove P != NP
  • From: Proginoskes
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: Bryan Olson
• Re: Water surface in hexahedron
  • From: Babua
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Is there a known algorithm to solve this "playoff ranking" problem?
  • From: Chris F Clark
• Re: Question on computational complexity
  • From: Proginoskes
• Re: Question on computational complexity
  • From: Anuj Dawar
• Re: Question on computational complexity
  • From: Artyom
• Re: Question on computational complexity
  • From: Anuj Dawar
• Re: Water surface in hexahedron
  • From: Patricia Shanahan
• Re: Discussion about transformation TSP to UniqueTSP
  • From: mathisart
• Re: Discussion about transformation TSP to UniqueTSP
  • From: mathisart
• Re: Water surface in hexahedron
  • From: Paul E. Black
• Re: Discussion about transformation TSP to UniqueTSP
  • From: mathisart
• Re: Discussion about transformation TSP to UniqueTSP
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: New thred of discussion about Mr. Diaby's algorithm
  • From: A . L .
• Re: New thred of discussion about Mr. Diaby's algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Question on computational complexity
  • From: Artyom
• Re: Discussion about transformation TSP to UniqueTSP
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• New thred of discussion about Mr. Diaby's algorithm
  • From: Radosław Hofman
• Discussion about transformation TSP to UniqueTSP
  • From: Radosław Hofman
• Re: Question on computational complexity
  • From: Anuj Dawar
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Water surface in hexahedron
  • From: macio
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Question on computational complexity
  • From: Artyom
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: GJ Woeginger
• Re: An easy way to prove P != NP
  • From: GJ Woeginger
• Re: An easy way to prove P != NP
  • From: Bryan Olson
• Re: An easy way to prove P != NP
  • From: Bryan Olson
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: i want paticipate
  • From: Proginoskes
• i want paticipate
  • From: hebaosman18
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Optimal Partitioning of an Undirected Graph Using Matroids
  • From: gore
• Re: reductions
  • From: Patricia Shanahan
• [Ann] Programming language research engine (PLRE.org)
  • From: Christopher Diggins
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• reductions
  • From: surf
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Rafael Almeida
• Re: An easy way to prove P != NP
  • From: tchow
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: maximal 3-colorable subset
  • From: GJ Woeginger
• maximal 3-colorable subset
  • From: johank
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: An easy way to prove P != NP
  • From: Proginoskes
• Re: LEDA on SUSE
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: LEDA on SUSE
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: Ben Bacarisse
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: An easy way to prove P != NP
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: LEDA on SUSE
  • From: thinkingthing
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: LEDA on SUSE
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• LEDA on SUSE
  • From: thinkingthing
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Antti Virtanen
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: transforming the subset sum problem?
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: transforming the subset sum problem?
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: transforming the subset sum problem?
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: An easy way to prove P != NP
  • From: Patricia Shanahan
• transforming the subset sum problem?
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: A . L .
• AC 2007 - Submission Deadline (2nd call): 18 December 2006
  • From: natty2006@xxxxxxxxx
• Re: An easy way to prove P != NP
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: GJ Woeginger
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: GJ Woeginger
• finding all dominator trees
  • From: amichail@xxxxxxxxx
• Re: Another LP model for TSP (by S. Gubin)
  • From: Zhu Guohun
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Finding edges of a given polyhedra in 3D
  • From: Babua
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Question in formal language
  • From: tomix
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Finding edges of a given polyhedra in 3D
  • From: macio
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radoslaw Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Zhu Guohun
• Re: Another LP model for TSP (by S. Gubin)
  • From: Zhu Guohun
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• complexity evaluation
  • From: fra
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Another LP model for TSP (by S. Gubin)
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• SIPTA Newsletter Announcement - New issue
  • From: Alessandro Antonucci
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• IEEE Computational Complexity Conference, submissions due Dec.3
  • From: Peter Bro Miltersen
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• A hard graph theory problem?
  • From: brian . james . kirby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Another LP model for TSP (by S. Gubin)
  • From: Zhu Guohun
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• PODS 2007: Second Call for Papers
  • From: marenas@xxxxxxxxxx
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: quantum computer can be simulated ?
  • From: Paul E. Black
• Re: more "information" in a sorted list ? or not ?
  • From: jacko
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: recursion theorem from sipser book ...
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: recursion theorem from sipser book ...
  • From: surf
• Re: more "information" in a sorted list ? or not ?
  • From: Goulu
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Help request
  • From: A . L .
• Re: Automated theorem proving
  • From: Dominic Mulligan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radoslaw Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: deepakc
• Re: Automated theorem proving
  • From: Jens Auer
• quantum computer can be simulated ?
  • From: anothertimeanotherplace
• Re: Automated theorem proving
  • From: Radosław Hofman
• Automated theorem proving
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Re: Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Another LP model for TSP (by S. Gubin)
  • From: Radosław Hofman
• Help request
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: recursion theorem from sipser book ...
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: devries
• Re: recursion theorem from sipser book ...
  • From: Patricia Shanahan
• Re: recursion theorem from sipser book ...
  • From: surf
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Stupid question: Infinitely many equivalent TMs?
  • From: Rick Decker
• Re: recursion theorem from sipser book ...
  • From: Patricia Shanahan
• Stupid question: Infinitely many equivalent TMs?
  • From: pietromas
• Re: recursion theorem from sipser book ...
  • From: surf
• Re: recursion theorem from sipser book ...
  • From: surf
• Re: Practical Use of Theory
  • From: Patricia Shanahan
• FPTAS for multi-choice knapsack
  • From: Christof Kluß
• Re: Practical Use of Theory
  • From: Radoslaw Hofman
• Re: Practical Use of Theory
  • From: Antti Virtanen
• Re: Calculating the base of a Congruence relation in modular arithmetic
  • From: Iftekhar Ahmed
• Re: recursion theorem from sipser book ...
  • From: Patricia Shanahan
• Re: recursion theorem from sipser book ...
  • From: surf
• recursion theorem from sipser book ...
  • From: surf
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Practical Use of Theory
  • From: icahit
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: context free grammars and ambiguity
  • From: Andrea Moro
• Re: context free grammars and ambiguity
  • From: Per Freem
• Re: context free grammars and ambiguity
  • From: eKo1
• Re: Practical Use of Theory
  • From: A . L .
• Practical Use of Theory
  • From: TangoGolfDelta
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• context free grammars and ambiguity
  • From: Per Freem
• martingales
  • From: Enzo Tagliazucchi
• Re: need help with this R.E & recursive sets
  • From: Enzo Tagliazucchi
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: more "information" in a sorted list ? or not ?
  • From: kaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: kingpin
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: more "information" in a sorted list ? or not ?
  • From: Ben Bacarisse
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: more "information" in a sorted list ? or not ?
  • From: Goulu
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: need help with this R.E & recursive sets
  • From: surf
• Re: need help with this R.E & recursive sets
  • From: Patricia Shanahan
• Re: need help with this R.E & recursive sets
  • From: surf
• need help with this R.E & recursive sets
  • From: surf
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: more "information" in a sorted list ? or not ?
  • From: Paul E. Black
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: more "information" in a sorted list ? or not ?
  • From: Ben Bacarisse
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: more "information" in a sorted list ? or not ?
  • From: A . L .
• Re: more "information" in a sorted list ? or not ?
  • From: Jussi Piitulainen
• more "information" in a sorted list ? or not ?
  • From: Goulu
• Re: what's the difference between "partial recursive function" and "recursive enumerable" ?
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: kingpin
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• what's the difference between "partial recursive function" and "recursive enumerable" ?
  • From: surf
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Calculating the base of a Congruence relation in modular arithmetic
  • From: mathisart
• Re: Calculating the base of a Congruence relation in modular arithmetic
  • From: Iftekhar Ahmed
• Re: Calculating the base of a Congruence relation in modular arithmetic
  • From: mathisart
• Re: An approach to proving P != NP
  • From: Ralph
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Analog proof that P=NP - any comments?
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Analog proof that P=NP - any comments?
  • From: Patricia Shanahan
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Analog proof that P=NP - any comments?
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Proving Ackermann not primitive recursive
  • From: Markus Triska
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Calculating the base of a Congruence relation in modular arithmetic
  • From: Iftekhar Ahmed
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: Discussion regarding Mr. Diabys algorithm
  • From: deepakc
• Re: An easy way to prove P != NP
  • From: Mitch
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tchow
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: mathisart
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radosław Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• How to formal prove the generalized pumping limma
  • From: kiki
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tuncay tekle
• Re: Discussion regarding Mr. Diabys algorithm
  • From: moustapha . diaby
• Re: Discussion regarding Mr. Diabys algorithm
  • From: goanna
• Re: Discussion regarding Mr. Diabys algorithm
  • From: goanna
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: tuncay tekle
• Re: The Final in Sorting Algorithm, High dimensional indexing
  • From: tuncay tekle
• Re: The Final in Sorting Algorithm, High dimensional indexing
  • From: sillybanter
• Proving Ackermann not primitive recursive
  • From: Enzo Tagliazucchi
• Re: Discussion regarding Mr. Diabys algorithm
  • From: A . L .
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: A . L .
• Re: The Final in Sorting Algorithm, High dimensional indexing
  • From: sravna
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: An approach to proving P != NP
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: Discussion regarding Mr. Diabys algorithm
  • From: Radoslaw Hofman
• Re: The Final in Sorting Algorithm, High dimensional indexing
  • From: BDH
• The Final in Sorting Algorithm, High dimensional indexing
  • From: sravna
• Re: An approach to proving P != NP
  • From: Proginoskes
• Re: An easy way to prove P != NP
  • From: Proginoskes
• Re: An approach to proving P != NP
  • From: Hans Hüttel
• An approach to proving P != NP
  • From: Ralph
• Re: Regular & context-free grammar problem
  • From: David Wagner
• PT random generators and Complexity
  • From: kramer31
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Sexual fascism and the Mark Foley scandal
  • From: A . L .
• Re: An easy way to prove P != NP
  • From: mathisart
• Re: An easy way to prove P != NP
  • From: Radoslaw Hofman
• Re: Restricted Turing machine
  • From: tuncay tekle
• Re: Another Bin problem
  • From: Proginoskes
• Re: An easy way to prove P != NP
  • From: Proginoskes
• Re: An easy way to prove P != NP
  • From: A . L .
• Another Bin problem
  • From: gse7en
• Re: An easy way to prove P != NP
  • From: eKo1
• Re: An easy way to prove P != NP
  • From: Craig Feinstein
• Re: majority element
  • From: Edward M. Reingold
• Re: An easy way to prove P != NP
  • From: eKo1
• Re: majority element
  • From: eKo1
• Re: majority element
  • From: eKo1
• Re: majority element
  • From: ericunfuk
• Re: majority element
  • From: eKo1
• An easy way to prove P != NP
  • From: Craig Feinstein
• Re: Proof techniques for recursive algorithms
  • From: Jens Auer
• majority element
  • From: ericunfuk
• Re: closure properties of regular languages
  • From: Chris F Clark
• Re: Proof techniques for recursive algorithms
  • From: Torben Ægidius Mogensen
• Re: closure properties of regular languages
  • From: Torben Ægidius Mogensen
• Re: closure properties of regular languages
  • From: surf
• Proof techniques for recursive algorithms
  • From: G Philip
• Re: closure properties of regular languages
  • From: Chris F Clark
• Re: closure properties of regular languages
  • From: Chris F Clark
• Re: closure properties of regular languages
  • From: surf
• Re: closure properties of regular languages
  • From: Rick Decker
• Re: closure properties of regular languages
  • From: surf
• Re: closure properties of regular languages
  • From: Chris F Clark
• Re: closure properties of regular languages
  • From: Ben Bacarisse
• closure properties of regular languages
  • From: surf
• Re: an optimization problem
  • From: A . L .
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman

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