STOC
2006
ACM
14 years 12 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
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 ...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
STOC
2006
ACM
14 years 12 months ago
2006
ACM
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 ...
STOC
2006
ACM
14 years 12 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 12 months ago
2006
ACM