STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...