FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
75
Voted
FOCS
1995
IEEE
15 years 11 days 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...
70
Voted
FOCS
1995
IEEE
15 years 11 days 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 ...
108
Voted
FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
FOCS
1995
IEEE
15 years 11 days 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 11 days ago
1995
IEEE
101
click to vote
FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
FOCS
1995
IEEE
15 years 11 days ago
1995
IEEE
