508 search results - page 87 / 102 » Quantum Computers |
STACS
2009
Springer
15 years 4 months 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...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
LCPC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of l...
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...