Sciweavers

RANDOM
1997
Springer
14 years 4 months ago
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volke...
RANDOM
1997
Springer
14 years 4 months ago
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
Steven M. Kautz
RANDOM
1997
Springer
14 years 4 months ago
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
Oded Goldreich, Shmuel Safra