3328 search results - page 206 / 666 » Topological Quantum Computation |
149
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...
136
Voted
SICHERHEIT
2008
15 years 5 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...
118
click to vote
COMBINATORICS
2004
15 years 3 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...
154
Voted
IFIPTCS
2010
15 years 1 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...
133
click to vote
ESANN
2007
15 years 5 months ago
2007
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...