comp.theory

Thread Index

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