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