2233 search results - page 122 / 447 » On the Complexity of Theory Curbing |
164
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
186
click to vote
EUROCRYPT
2004
Springer
15 years 11 months 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...
150
click to vote
IV
2003
IEEE
15 years 11 months 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...
165
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
184
click to vote
POPL
2010
ACM
16 years 3 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)...