151
click to vote
FOCS
15 years 5 months 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...
139
click to vote
FOCS
15 years 5 months 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...
115
click to vote
FOCS
15 years 5 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 ...
115
click to vote
FOCS
15 years 5 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...
113
click to vote
FOCS
15 years 5 months ago
1995 IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
|
Theoretical Computer Science