164 search results - page 4 / 33 » Improved upper bounds on sizes of codes |
139
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
148
click to vote
STACS
2009
Springer
16 years 17 days ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
174
Voted
SAC
2002
ACM
15 years 5 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
180
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
147
click to vote
SAT
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...