17 search results - page 2 / 4 » focs 1995 |
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
65
Voted
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...