2957 search results - page 124 / 592 » The Complexity of Polynomial-Time Approximation |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
ASIAN
2003
Springer
14 years 3 months ago
2003
Springer
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
TAMC
2010
Springer
14 years 3 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...