comp.theory

• Thread Index

---

• Re: Finding edges of a given polyhedra in 3D
  • From: Babua
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radosław Hofman
• an optimization problem
  • From: J. Wu
• Re: Restricted Turing machine
  • From: Torben Ægidius Mogensen
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Growth Rate of Level-k Goodstein Function
  • From: r.e.s.
• Re: Finding edges of a given polyhedra in 3D
  • From: macio
• Re: Finding edges of a given polyhedra in 3D
  • From: Patricia Shanahan
• Re: Finding edges of a given polyhedra in 3D
  • From: macio
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: tchow
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Finding edges of a given polyhedra in 3D
  • From: Patricia Shanahan
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Finding edges of a given polyhedra in 3D
  • From: klaus hoffmann
• Re: Finding edges of a given polyhedra in 3D
  • From: klaus hoffmann
• Re: Finding edges of a given polyhedra in 3D
  • From: Patricia Shanahan
• Re: Finding edges of a given polyhedra in 3D
  • From: macio
• Re: Finding edges of a given polyhedra in 3D
  • From: klaus hoffmann
• Re: Restricted Turing machine
  • From: Rick Decker
• Re: Restricted Turing machine
  • From: Bjarke Walling
• Re: Restricted Turing machine
  • From: tuncay tekle
• Re: Restricted Turing machine
  • From: tuncay tekle
• Restricted Turing machine
  • From: Bjarke Walling
• Finding edges of a given polyhedra in 3D
  • From: macio
• The Mathematician's Algorithm and Automated Theory Generation
  • From: markwh04
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• pebble automata
  • From: amalmanuel
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: tchow
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: tchow
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• CFP: APPLIED COMPUTING 2007 - Submission Deadline extended
  • From: natty2006@xxxxxxxxx
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: radekh
• Re: Solve math inequality with SAT (CNF)
  • From: iatsonios
• Re: Top down parsing
  • From: aloha.kakuikanu
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: tchow
• EROW 2007: Submission Deadline Extension
  • From: marenas@xxxxxxxxxx
• Re: Model time delay in finit state machine
  • From: Barb Knox
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Model time delay in finit state machine
  • From: Peter Wing Larsen
• Re: Solve math inequality with SAT (CNF)
  • From: tchow
• Solve math inequality with SAT (CNF)
  • From: mehassan@xxxxxxxxxxx
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radosław Hofman
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: John Gabbriel
• Re: Parse tree problem
  • From: Rick Decker
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radoslaw Hofman
• Re: Top down parsing
  • From: amitsaraff
• Top down parsing
  • From: anandr86
• Parse tree problem
  • From: anandr86
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radosław Hofman
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radosław Hofman
• Re: Growth Rate of Level-k Goodstein Function
  • From: Deedlit
• Re: computing on streams of data
  • From: pamelafluente
• Re: computing on streams of data
  • From: Patricia Shanahan
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: moustapha . diaby
• Re: computing on streams of data
  • From: ghoul
• Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: tchow
• Re: computing on streams of data
  • From: ghoul
• Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
  • From: Radosław Hofman
• Re: computing on streams of data
  • From: pamelafluente
• Re: computing on streams of data
  • From: Patricia Shanahan
• Re: computing on streams of data
  • From: ghoul
• Re: computing on streams of data
  • From: ghoul
• Re: Growth Rate of Level-k Goodstein Function
  • From: r.e.s.
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: eKo1
• Re: Growth Rate of Level-k Goodstein Function
  • From: Deedlit
• Hopcroft-Tarjan Planarity Algorithm (problem with edge weighting?)
  • From: Kakihara
• Hopcroft-Tarjan Planarity Algorithm (problem with edge weighting?)
  • From: Kakihara
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: Robby Goetschalckx
• Re: A Possible "solution" to the Halting Problem
  • From: Peter Olcott
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: eKo1
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: eKo1
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: Robby Goetschalckx
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: eKo1
• Re: Direct Euler Cycle and de Brujin Sequence
  • From: Robby Goetschalckx
• Direct Euler Cycle and de Brujin Sequence
  • From: eKo1
• Re: K-regular bipartitie graph
  • From: Darth
• Re: Algorithm For Calculating Permutations
  • From: eKo1
• Halting Problem: There are two kinds of people, those who finish what they start and those who ...
  • From: Casey Hawthorne
• Re: proving string has atmost k length whose NFA has k states
  • From: Rupesh Bhochhibhoya
• Re: Algorithm For Calculating Permutations
  • From: Proginoskes
• Algorithm For Calculating Permutations
  • From: eKo1
• Re: computing on streams of data
  • From: Patricia Shanahan
• Re: computing on streams of data
  • From: pamelafluente
• Re: K-colorable graphs
  • From: icahit
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: kitty
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: kitty
• Re: K-colorable graphs
  • From: Proginoskes
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: Barb Knox
• Re: Growth Rate of Level-k Goodstein Function
  • From: r.e.s.
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: Rick Decker
• Re: Growth Rate of Level-k Goodstein Function
  • From: Deedlit
• Re: how to prove: let L be any subset of 0*. is L regular?
  • From: Barb Knox
• Re: computing on streams of data
  • From: A.G.McDowell
• how to prove: let L be any subset of 0*. is L regular?
  • From: yanlu06
• Re: proving string has atmost k length whose NFA has k states
  • From: Rick Decker
• Re: computing on streams of data
  • From: pamelafluente
• Re: computing on streams of data
  • From: eKo1
• Re: computing on streams of data
  • From: pamelafluente
• proving string has atmost k length whose NFA has k states
  • From: Rupesh Bhochhibhoya
• Re: computing on streams of data
  • From: Paul E. Black
• Re: computing on streams of data
  • From: A . L .
• Re: computing on streams of data
  • From: eKo1
• computing on streams of data
  • From: pamelafluente
• Proof of Correctness - Jarvis' March
  • From: eKo1
• Re: K-colorable graphs
  • From: icahit
• Re: Master Theorem
  • From: Patricia Shanahan
• Re: Finding median in theta(n^lg3) time
  • From: eKo1
• Finding median in theta(n^lg3) time
  • From: ericunfuk
• Re: K-colorable graphs
  • From: Proginoskes
• Re: K-colorable graphs
  • From: icahit
• Re: K-colorable graphs
  • From: Jamie Andrews; real address @ bottom of message
• Re: Convex Hull of S and S'
  • From: eKo1
• Re: Master Theorem
  • From: eKo1
• Re: Master Theorem
  • From: eKo1
• Re: About jumps in trees
  • From: eKo1
• Re: About jumps in trees
  • From: Pat
• Re: About jumps in trees
  • From: Pat
• Master Theorem
  • From: xuwenduan2010@xxxxxxxxx
• Re: K-regular bipartitie graph
  • From: Proginoskes
• Re: Convex Hull of S and S'
  • From: eKo1
• Re: K-regular bipartitie graph
  • From: Darth
• Re: About jumps in trees
  • From: eKo1
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: Convex Hull of Points on a Straight Line
  • From: Babua
• Convex Hull of S and S'
  • From: eKo1
• Re: K-colorable graphs
  • From: icahit
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• About jumps in trees
  • From: Pat
• Re: Convex Hull of Points on a Straight Line
  • From: Babua
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: Convex Hull of Points on a Straight Line
  • From: Babua
• Re: K-regular bipartitie graph
  • From: Proginoskes
• Re: Information for efficent computation of median
  • From: Tor Myklebust
• Re: Finding Adjacent Vertices
  • From: eKo1
• K-regular bipartitie graph
  • From: Darth
• Re: Finding Adjacent Vertices
  • From: Proginoskes
• Finding Adjacent Vertices
  • From: eKo1
• Re: comp.theory vs. sci.math
  • From: William Elliot
• Qustion: a special eigenvalue problem
  • From: Wanderer
• Re: How to compute "A1 x. .. x An subset B" fast if B is fixed? Reduced maximal set of Cartesian products.
  • From: sasha mal
• Re: Gray Code
  • From: GCRhoads
• Re: K-colorable graphs
  • From: Proginoskes
• Re: K-colorable graphs
  • From: Proginoskes
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: Convex Hull of Points on a Straight Line
  • From: Babua
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: K-colorable graphs
  • From: KS
• Re: Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: Obtaining a combinatorial proof for the PCP theorem..
  • From: tchow
• Re: Computable categories?
  • From: Jose Juan Mendoza Rodriguez
• Re: Einstein’s E=mc2 . Should Newton , De Pretto , Preston, Hasenohrl and Soddi, Planck be given credit for discovery of E=mc2. ?
  • From: AJAY SHARMA
• Re: Einstein’s E=mc2 . Should Newton , De Pretto , Preston, Hasenohrl and Soddi, Planck be given credit for discovery of E=mc2. ?
  • From: AJAY SHARMA
• Re: How to compute "A1 x. .. x An subset B" fast if B is fixed? Reduced maximal set of Cartesian products.
  • From: Proginoskes
• Re: question concerning deterministic finite state automata
  • From: Jim Nastos
• Re: K-colorable graphs
  • From: Jim Nastos
• Re: K-colorable graphs
  • From: Patricia Shanahan
• Re: K-colorable graphs
  • From: Michal Nazarewicz
• Correct title for "Maximal Common Subsets" problem?
  • From: kendall
• question concerning deterministic finite state automata
  • From: Per Freem
• K-colorable graphs
  • From: KS
• Re: Einstein’s E=mc2 . Should Newton , De Pretto , Preston, Hasenohrl and Soddi, Planck be given credit for discovery of E=mc2. ?
  • From: Enzo Tagliazucchi
• Convex Hull of Points on a Straight Line
  • From: eKo1
• Re: Gray Code
  • From: bwaichu@xxxxxxxxx
• Re: Gray Code
  • From: GCRhoads
• Obtaining a combinatorial proof for the PCP theorem..
  • From: iatsonios
• Manuscript of thesis which may be of interest
  • From: Antti Ylikoski
• Re: On the complexity of determining whether n numbers are distinct
  • From: eKo1
• Re: On the complexity of determining whether n numbers are distinct
  • From: eKo1
• Re: On the complexity of determining whether n numbers are distinct
  • From: eKo1

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