317 search results - page 7 / 64 » Geometry of abstraction in quantum computation |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
AISC
2008
Springer
14 years 12 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
104
click to vote
EUROCRYPT
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
FCS
2006
14 years 11 months ago
2006
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
WDAG
1998
Springer
15 years 2 months ago
1998
Springer
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...