523 search results - page 35 / 105 » On the Power of Quantum Proofs |
109
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
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...
100
click to vote
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
ACL
1997
15 years 3 months ago
1997
This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to ...
110
click to vote
MFCS
2010
Springer
15 years 11 days ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
120
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...