523 search results - page 31 / 105 » On the Power of Quantum Proofs |
110
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
165
click to vote
LPAR
2012
Springer
13 years 9 months ago
2012
Springer
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
130
click to vote
CADE
2004
Springer
15 years 7 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
169
click to vote
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
125
Voted
CADE
2004
Springer
16 years 2 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...