587 search results - page 103 / 118 » Quantum computation and quantum information |
STACS
2009
Springer
14 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
14 years 4 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...
FOCS
2002
IEEE
14 years 2 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...
SICHERHEIT
2008
13 years 11 months ago
2008
Abstract: The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardne...
COMBINATORICS
2004
13 years 9 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...