459 search results - page 13 / 92 » Computational Complexity of Probabilistic Disambiguation |
STOC
2005
ACM
16 years 3 hour 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...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
103
click to vote
STOC
1993
ACM
15 years 3 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
183
click to vote
ICDT
2009
ACM
16 years 12 days ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
86
Voted
CSFW
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...