13603 search results - page 134 / 2721 » On the Computational Complexity of Cut-Reduction |
162
click to vote
FOCS
2006
IEEE
16 years 6 days ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
154
Voted
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
16 years 28 days ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
138
click to vote
CHI
2001
ACM
16 years 6 months ago
2001
ACM
Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acqui...
157
Voted
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
214
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...