20831 search results - page 134 / 4167 » Quantum Computation and Information |
FOCS
2002
IEEE
14 years 1 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 10 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 8 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...
IFIPTCS
2010
13 years 6 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...
IRI
2009
IEEE
14 years 3 months ago
2009
IEEE