233 search results - page 16 / 47 » Interactive Proofs For Quantum Computations |
128
click to vote
TABLEAUX
1995
Springer
15 years 7 months ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
134
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
135
click to vote
SWAP
2008
15 years 5 months ago
2008
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
159
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
124
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...