523 search results - page 45 / 105 » On the Power of Quantum Proofs |
NIPS
2001
15 years 1 months ago
2001
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
COMPUTING
2006
14 years 12 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
TPHOL
1992
IEEE
15 years 3 months ago
1992
IEEE
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
IJFCS
2011
14 years 6 months ago
2011
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...