comp.theory
- Gray Code,
bwaichu@xxxxxxxxx
- Re: Gray Code, eKo1
- Please add your name, vincent64
- NMR experiment factors numbers with Gauss sums - But is it quantum computing?, gautam.kalia18@xxxxxxxxx
- Re: How to compute "A1 x. .. x An subset B" fast if B is fixed? Reduced maximal set of Cartesian products.,
William Elliot
- <Possible follow-ups>
- Re: How to compute "A1 x. .. x An subset B" fast if B is fixed? Reduced maximal set of Cartesian products., William Elliot
- Best-first search metaheuristic help, kingpin
- I need to find some problems like this, kingpin
- On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct,
Markus Triska
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct, Markus Triska
- Re: On the complexity of determining whether n numbers are distinct, Patricia Shanahan
- Re: On the complexity of determining whether n numbers are distinct, goanna
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Patricia Shanahan
- Re: On the complexity of determining whether n numbers are distinct, Ralph Hartley
- Re: On the complexity of determining whether n numbers are distinct, Patricia Shanahan
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Markus Triska
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, goanna
- Re: On the complexity of determining whether n numbers are distinct, sasha mal
- Re: On the complexity of determining whether n numbers are distinct, Markus Triska
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct,
Googmeister
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Tor Myklebust
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, Tor Myklebust
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct,
Googmeister
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, eKo1
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct, Googmeister
- Re: On the complexity of determining whether n numbers are distinct,
eKo1
- Re: On the complexity of determining whether n numbers are distinct,
Markus Triska
- An algorithm with Minimum vertex cover without considering its performance,
wtxwtx
- Re: An algorithm with Minimum vertex cover without considering its performance,
Patricia Shanahan
- Re: An algorithm with Minimum vertex cover without considering its performance,
wtxwtx
- Re: An algorithm with Minimum vertex cover without considering its performance, eKo1
- Re: An algorithm with Minimum vertex cover without considering its performance, Weng Tianxiang
- Re: An algorithm with Minimum vertex cover without considering its performance, eKo1
- Re: An algorithm with Minimum vertex cover without considering its performance, Weng Tianxiang
- Re: An algorithm with Minimum vertex cover without considering its performance, Patricia Shanahan
- Re: An algorithm with Minimum vertex cover without considering its performance, eKo1
- Re: An algorithm with Minimum vertex cover without considering its performance, eKo1
- Re: An algorithm with Minimum vertex cover without considering its performance, Weng Tianxiang
- Re: An algorithm with Minimum vertex cover without considering its performance,
wtxwtx
- Re: An algorithm with Minimum vertex cover without considering its performance,
Patricia Shanahan
- To which field does this belong?, Hari
- (Probably flawed) Polynomial time Graph Isomorphism,
Bill Cox
- Re: (Probably flawed) Polynomial time Graph Isomorphism, neleai
- Re: (Probably flawed) Polynomial time Graph Isomorphism, Patricia Shanahan
- Re: (Probably flawed) Polynomial time Graph Isomorphism, yaoziyuan
- Re: (Probably flawed) Polynomial time Graph Isomorphism, klaus hoffmann
- the lowest number of comparisons in string matching, laura
- PODS 2007 Call for Papers, marenas@xxxxxxxxxx
- Minimal Representation of a Set,
yaoziyuan
- Re: Minimal Representation of a Set, yaoziyuan
- Re: Minimal Representation of a Set,
yaoziyuan
- Re: Minimal Representation of a Set,
yaoziyuan
- Re: Minimal Representation of a Set, yaoziyuan
- Re: Minimal Representation of a Set,
yaoziyuan
- Possible to estimate maximum maximal independent set and minimum maximal independent set?, iwan2no
- New Survey Book in Data Streams, xlf07221
- Problem dealing with a cost optimization algorithm, with cost updating after each iteration, wruehl
- Traditional computer science vs. Human-oriented computer science,
yaoziyuan
- Re: Traditional computer science vs. Human-oriented computer science, yaoziyuan
- Re: Traditional computer science vs. Human-oriented computer science, yaoziyuan
- Re: Traditional computer science vs. Human-oriented computer science, Patricia Shanahan
- Re: Traditional computer science vs. Human-oriented computer science, yaoziyuan
- Designing hash table for a large list of last names, sprash25
- CFP: IADIS INTERNATIONAL CONFERENCE APPLIED COMPUTING 2007, natty2006@xxxxxxxxx
- what is the best method to check if a number is a perfect square or not??,
kshudra
- Re: what is the best method to check if a number is a perfect square or not??, Torben Ægidius Mogensen
- Re: what is the best method to check if a number is a perfect square or not??, Szabolcs Ivan
- Cross product of two DFAs,
meyousikmann
- Re: Cross product of two DFAs,
Szabolcs Ivan
- Re: Cross product of two DFAs, meyousikmann
- Re: Cross product of two DFAs,
Szabolcs Ivan
- More beginner questions about SAT...,
D. C.
- Re: More beginner questions about SAT..., Szabolcs Ivan
- Re: More beginner questions about SAT..., stephen
- Re: More beginner questions about SAT...,
sasha mal
- Re: More beginner questions about SAT...,
Russell Easterly
- Re: More beginner questions about SAT..., sasha mal
- Re: More beginner questions about SAT...,
D. C.
- Re: More beginner questions about SAT..., sasha mal
- Re: More beginner questions about SAT..., Tor Myklebust
- Re: More beginner questions about SAT..., sasha mal
- Re: More beginner questions about SAT...,
Russell Easterly
- The number of elements that are inverse to themselfes in the multiplicative group Z_n, Thomas Glanzmann
- how these numbers are called ?,
laura
- Re: how these numbers are called ?, Paul E. Black
- Turing machine variants,
nosherwan . minwalla
- Re: Turing machine variants,
Joachim Pimiskern
- Re: Turing machine variants,
Antti Ylikoski
- Re: Turing machine variants, minsky
- Re: Turing machine variants,
Antti Ylikoski
- Re: Turing machine variants, tchow
- Re: Turing machine variants,
Joachim Pimiskern
- Network flow: consistent assignment of flow value for "inner" vertices,
dkoschuetzki@xxxxxxxxxxxxxx
- Re: Network flow: consistent assignment of flow value for "inner" vertices,
eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices,
dkoschuetzki@xxxxxxxxxxxxxx
- Re: Network flow: consistent assignment of flow value for "inner" vertices, eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices, dkoschuetzki@xxxxxxxxxxxxxx
- Re: Network flow: consistent assignment of flow value for "inner" vertices, eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices, dkoschuetzki@xxxxxxxxxxxxxx
- Re: Network flow: consistent assignment of flow value for "inner" vertices, eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices, Tor Myklebust
- Re: Network flow: consistent assignment of flow value for "inner" vertices, eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices, KS
- Re: Network flow: consistent assignment of flow value for "inner" vertices, eKo1
- Re: Network flow: consistent assignment of flow value for "inner" vertices,
dkoschuetzki@xxxxxxxxxxxxxx
- Re: Network flow: consistent assignment of flow value for "inner" vertices,
eKo1
- CRT problem: using mod operation in sum does break the computation,
Thomas Glanzmann
- Re: CRT problem: using mod operation in sum does break the computation, Gerhard Pfeiffer
- Implementation of Linear Programing algorithm, Radosław Hofman
- Re: Algorithms for finding if two DFA's are equivalent, Szabolcs Ivan
- choise networks flow textbook, netbsd7
- help: a O(n) algorithm to find the longest path in a tree,
netbsd7
- Re: help: a O(n) algorithm to find the longest path in a tree, eKo1
- Re: help: a O(n) algorithm to find the longest path in a tree, ekillaby@xxxxxxxxx
- Re: help: a O(n) algorithm to find the longest path in a tree, sillybanter
- Re: help: a O(n) algorithm to find the longest path in a tree, Szabolcs Ivan
- Probability of an "Identical And Wrong" result,
Mike
- Re: Probability of an "Identical And Wrong" result, Paul E. Black
- Re: Probability of an "Identical And Wrong" result,
Patricia Shanahan
- Re: Probability of an "Identical And Wrong" result,
Mike
- Re: Probability of an "Identical And Wrong" result, Patricia Shanahan
- Re: Probability of an "Identical And Wrong" result,
Mike
- Re: Probability of an "Identical And Wrong" result, David Wagner
- Re: Probability of an "Identical And Wrong" result, D. C.
- Re: Probability of an "Identical And Wrong" result,
tchow
- Re: Probability of an "Identical And Wrong" result,
Paul E. Black
- Re: Probability of an "Identical And Wrong" result, Mike
- Re: Probability of an "Identical And Wrong" result, Patricia Shanahan
- Re: Probability of an "Identical And Wrong" result, tchow
- Re: Probability of an "Identical And Wrong" result, tchow
- Re: Probability of an "Identical And Wrong" result, Mike
- Re: Probability of an "Identical And Wrong" result, tchow
- Re: Probability of an "Identical And Wrong" result,
Paul E. Black
- Re: Probability of an "Identical And Wrong" result, Chris F Clark
- PhD Student Position/Algorithms+Complexity Theory, petej
- help:prove NP-Complete,
netbsd7
- Re: help:prove NP-Complete, stephen
- Re: help:prove NP-Complete, Babua
- Discussion about article claiming that P=NP (http://arxiv.org/abs/cs.CC/0609005),
Radosław Hofman
- Re: Discussion about article claiming that P=NP (http://arxiv.org/abs/cs.CC/0609005), tchow
- Re: Discussion about article claiming that P=NP (http://arxiv.org/abs/cs.CC/0609005), Radosław Hofman
- Re: Discussion about article claiming that P=NP (http://arxiv.org/abs/cs.CC/0609005), Radosław Hofman
- Re: Discussion about article claiming that P=NP (http://arxiv.org/abs/cs.CC/0609005), Radosław Hofman
- Re: salesman problem is in P?, Radoslaw Hofman
- Re: How many clauses does a minimal DNF have?, Mike Robson
- What's the grammar of 2-copy language,
betty . hou
- Re: What's the grammar of 2-copy language, Torben Ægidius Mogensen
- Final Call for Papers: STACS 2007, Christof Loeding
- CACM sample collection?, t . aubertin
- Re: How to compute "A1 x. .. x An subset B" fast if B is fixed?,
sasha mal
- <Possible follow-ups>
- Re: How to compute "A1 x. .. x An subset B" fast if B is fixed?, sasha mal
- Re: How to compute "A1 x. .. x An subset B" fast if B is fixed?, Radoslaw Hofman
- Re: Tree search,
KS
- Re: Tree search,
Thomas Samson
- Re: Tree search,
KS
- Re: Tree search, KS
- Re: Tree search, kingpin
- Re: Tree search, KS
- Re: Tree search,
KS
- Re: Tree search,
Thomas Samson
- Have a go a tearing this apart ...,
Denis . Sjostrom
- Re: Have a go a tearing this apart ...,
Paul E. Black
- Re: Have a go a tearing this apart ..., Denis . Sjostrom
- Re: Have a go a tearing this apart ..., Denis . Sjostrom
- Re: Have a go a tearing this apart ...,
Paul E. Black
