comp.theory

• Date Index

---

• Proof of BFS Algorithm, berndlosert
• Call for Participation: Unconventional Computing 2005, Michael J. Dinneen
• CRC poly for 23KByte data, mister . steve . smith
• Disjoint circle merge NP complete for L^n error?, Gene
  • Re: Disjoint circle merge NP complete for L^n error?, Torben Ægidius Mogensen
    • Re: Disjoint circle merge NP complete for L^n error?, Gene
    • Re: Disjoint circle merge NP complete for L^n error?, Ralph Hartley
      • Re: Disjoint circle merge NP complete for L^n error?, Gene
• time complexity, gauravbjain
  • Re: time complexity, Mike Robson
    • Re: time complexity, gauravbjain
• ILP ==> 0,1 ILP ==>SAT, Thomas A. Li
  • Re: ILP ==> 0,1 ILP ==>SAT, Keith Ramsay
    • Re: ILP ==> 0,1 ILP ==>SAT, Thomas A. Li
• Oh, forgot other question regarding regular expressions, niclane
  • Re: Oh, forgot other question regarding regular expressions, Rick Decker
• NFA behaviour with "empty string", niclane
  • Re: NFA behaviour with "empty string", Rick Decker
• CfP : Workshop on Model Design and Validation (MoDeVa) at Models, bbaudry
• fsa: compleixity and frequency, John R W Woodward
  • Re: fsa: compleixity and frequency, Keith Ramsay
• NTM -> DTM Transformation?, Chris Johnson
  • Re: NTM -> DTM Transformation?, Zeljko A.
• to CNF efficiently, Thomas A. Li
  • Re: to CNF efficiently, Daniel A. Jimenez
    • Re: to CNF efficiently, Thomas A. Li
• NP-complete and NP-Hard?, yijun_lily
  • Re: NP-complete and NP-Hard?, Torkel Franzen
    • Re: NP-complete and NP-Hard?, yijun_lily@xxxxxxxxx
    • Re: NP-complete and NP-Hard?, Jym
      • Re: NP-complete and NP-Hard?, Torkel Franzen
      • Re: NP-complete and NP-Hard?, Colin Percival
  • Re: NP-complete and NP-Hard?, Keith Ramsay
    • Re: NP-complete and NP-Hard?, yijun_lily@xxxxxxxxx
      • Re: NP-complete and NP-Hard?, newstome
      • Re: NP-complete and NP-Hard?, Jym
  • Re: NP-complete and NP-Hard?, Torben Ægidius Mogensen
    • Re: NP-complete and NP-Hard?, Bart Demoen
      • Re: NP-complete and NP-Hard?, Jean-Marc Bourguet
      • Re: NP-complete and NP-Hard?, Daniel A. Jimenez
      • Re: NP-complete and NP-Hard?, Bryan Olson
      • Re: NP-complete and NP-Hard?, Shashi
      • Re: NP-complete and NP-Hard?, Bart Demoen
    • Re: NP-complete and NP-Hard?, Bryan Olson
• help with problems on computability needed!!, ahtwong
  • A little advice on strategy (no solutions. Sorry), Theory Man
• shortest path with constraints that some nodes can not be on the same pth, news.usc.edu
  • Re: shortest path with constraints that some nodes can not be on the same pth, almeidaraf@xxxxxxxxx
    • Re: shortest path with constraints that some nodes can not be on the same pth, news.usc.edu
  • Re: shortest path with constraints that some nodes can not be on the same pth, Yajun
• Simplified best time bounds, rectangular matrix multiplication, Jeremy Spinrad
• my web nightmare., bob
  • Re: my web nightmare., bob
• The power of parallel computation, D. J. Bernstein
  • Re: The power of parallel computation, Claudio Grondi
  • Re: The power of parallel computation, examachine
  • Re: The power of parallel computation, Randy
    • Re: The power of parallel computation, D. J. Bernstein
      • Re: The power of parallel computation, Bodo Moeller
• average distance in a graph, Aldar C-F. Chan
• Anyone seen the "Minimize the Maximum Load on a Node" problem in the context of facility location?, Animesh Pathak
• Input size interpretation of Traveling Salesman Problem etc, quite basic., Olov Andersson
  • Re: Input size interpretation of Traveling Salesman Problem etc, quite basic., Matt Timmermans
  • Re: Input size interpretation of Traveling Salesman Problem etc, quite basic., Joachim Pimiskern
• PaSCo Research Training Group - Grants for Doctoral and Postdoctoral studies, belkner
• http://www.ittopinterviewquestions.com/, symbianstuff
• Terminology/typo corrections in "P = NP: LP Formulation of the TSP", moustapha . diaby
• Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Patricia Shanahan
  • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
    • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Bryan Olson
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Bryan Olson
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Bryan Olson
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Bryan Olson
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Saenta@xxxxxxxxx
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", Bryan Olson
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
      • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP", moustapha . diaby
• Halting problem undecidable or semidecidable?, devriese
  • Re: Halting problem undecidable or semidecidable?, Jym
    • Re: Halting problem undecidable or semidecidable?, Edsko de Vries
    • Re: Halting problem undecidable or semidecidable?, Jan de Vos
  • Re: Halting problem undecidable or semidecidable?, Amar
  • Re: Halting problem undecidable or semidecidable?, Mitch Harris
• Re: are Real Numbers evil? The answer(?)., Brandon J. Van Every
  • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
    • Re: are Real Numbers evil? The answer(?)., Navin Kumar
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., tchow
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
  • <Possible follow-ups>
  • Re: are Real Numbers evil? The answer(?)., examachine
    • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., Brandon J. Van Every
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., Brandon J. Van Every
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., Navin Kumar
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., Navin Kumar
      • Re: are Real Numbers evil? The answer(?)., Navin Kumar
      • Re: are Real Numbers evil? The answer(?)., examachine
      • Re: are Real Numbers evil? The answer(?)., Claudio Grondi
      • Re: are Real Numbers evil? The answer(?)., examachine
• Re: are Real Numbers evil?, Brandon J. Van Every
  • Re: are Real Numbers evil?, Claudio Grondi
  • <Possible follow-ups>
  • Re: are Real Numbers evil?, Brandon J. Van Every
  • Re: are Real Numbers evil?, Brandon J. Van Every
    • Re: are Real Numbers evil?, Claudio Grondi
  • Re: are Real Numbers evil?, tttpppggg
    • Re: are Real Numbers evil?, Claudio Grondi
      • Re: are Real Numbers evil?, tttpppggg
      • Re: are Real Numbers evil?, Claudio Grondi
      • Re: are Real Numbers evil?, tttpppggg
• ZFC, Amar
  • Re: ZFC, tchow
    • Re: ZFC, Jesse Alama
      • Re: ZFC, tchow
    • Re: ZFC, Jesse Alama
      • Re: ZFC, tchow
      • Re: ZFC, examachine
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Barb Knox
      • Re: ZFC, examachine
      • Re: ZFC, Barb Knox
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Barb Knox
      • Re: ZFC, Keith Ramsay
      • Re: ZFC, examachine
      • Re: ZFC, Aatu Koskensilta
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Bhupinder Singh Anand
      • Re: ZFC, Aatu Koskensilta
      • Re: ZFC, examachine
      • Re: ZFC, Barb Knox
      • Re: ZFC, examachine
      • Re: ZFC, Barb Knox
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, examachine
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Aatu Koskensilta
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, tchow
    • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Message not available
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Message not available
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Keith Ramsay
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, Hans Aberg
      • Re: ZFC, Torkel Franzen
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Hans Aberg
      • Re: ZFC, tchow
      • Re: ZFC, Amar
      • Re: ZFC, Jesse Alama
• reasoning about domain and range of memory state, Brandon J. Van Every
• What is an O(n * (lg(n lg n))^2) probabilistic soln to LCS (longest-common-subsequence) called, by whom?, Navin Kumar
  • Re: What is an O(n * (lg(n lg n))^2) probabilistic soln to LCS (longest-common-subsequence) called, by whom?, Navin Kumar
  • Re: What is an O(n * (lg(n lg n))^2) probabilistic soln to LCS (longest-common-subsequence) called, by whom?, Navin Kumar
  • Re: What is an O(n * (lg(n lg n))^2) probabilistic soln to LCS (longest-common-subsequence) called, by whom?, Michiel de Bondt
    • Re: What is an O(n * (lg(n lg n))^2) probabilistic soln to LCS (longest-common-subsequence) called, by whom?, Navin Kumar
• Re: elegant way of pattern matching algorithms, vib
• Re: Catalog of undecidable problems?, Siamak
  • <Possible follow-ups>
  • Re: Catalog of undecidable problems?, Rajsekar
    • Re: Catalog of undecidable problems?, examachine
• Re: Complexity theory citation sought, Amar
  • <Possible follow-ups>
  • Re: Complexity theory citation sought, Henning Makholm

• Security
• UNIX
• Linux
• Coding
• Usenet

• Archive
• About
• Privacy
• Search
• Imprint

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