7486 search results - page 148 / 1498 » The Limits of Quantum Computers |
186
click to vote
FOCS
2002
IEEE
15 years 11 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...
168
click to vote
SICHERHEIT
2008
15 years 7 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...
141
click to vote
COMBINATORICS
2004
15 years 5 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...
178
click to vote
IFIPTCS
2010
15 years 4 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...
150
click to vote
JSAC
2010
15 years 4 months ago
2010
—The use of passive optical networks (PONs) enables access rates of multi-Gbit/sec bandwidth and provision of quality of service for high definition multimedia services. In this...