119 search results - page 20 / 24 » stoc 2010 |
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
115
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
106
Voted
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
112
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...