comp.theory

• Thread Index

---

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

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