Sciweavers

STOC
2007
ACM
82views Algorithms» more  STOC 2007»
14 years 5 months ago
Interval completion with few edges
Pinar Heggernes, Christophe Paul, Jan Arne Telle, ...
STOC
2007
ACM
93views Algorithms» more  STOC 2007»
14 years 5 months ago
Degree-constrained network flows
P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordo...
STOC
2007
ACM
123views Algorithms» more  STOC 2007»
14 years 5 months ago
A 3-query PCP over integers
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...
Venkatesan Guruswami, Prasad Raghavendra
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 5 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
14 years 5 months ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 5 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 5 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
14 years 5 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu