Sciweavers

STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 6 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
STOC
2006
ACM
115views Algorithms» more  STOC 2006»
14 years 6 months ago
Zero knowledge with efficient provers
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
Minh-Huyen Nguyen, Salil P. Vadhan
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 6 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 6 months ago
Local zero knowledge
Silvio Micali, Rafael Pass
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 6 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
STOC
2006
ACM
77views Algorithms» more  STOC 2006»
14 years 6 months ago
Graph partitioning using single commodity flows
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 6 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 6 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
STOC
2006
ACM
78views Algorithms» more  STOC 2006»
14 years 6 months ago
Deterministic extractors for small-space sources
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zucke...