1142 search results - page 145 / 229 » Is the Brain a Quantum Computer |
130
click to vote
STACS
2009
Springer
15 years 11 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...
143
click to vote
ASIACRYPT
2009
Springer
15 years 10 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...
136
click to vote
APSCC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
142
click to vote
STACS
2007
Springer
15 years 10 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...
150
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...