2479 search results - page 168 / 496 » Quantum complexity theory |
203
click to vote
EUROCRYPT
2004
Springer
16 years 5 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
160
click to vote
IV
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper we present a “lightweight” visual formalism that can be used to examine the state space complexity of an interface. The method can form a basis for designing, te...
368
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
193
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
204
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...