2661 search results - page 253 / 533 » Quantum Complexity Classes |
151
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
148
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
141
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
152
click to vote
HICSS
2000
IEEE
15 years 8 months ago
2000
IEEE
Computers and networks are increasingly able to support distributed collaborative multimedia applications. In fact, the growing interest in distance learning reflects the awarenes...
146
click to vote
FASE
2006
Springer
15 years 8 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...