Sciweavers

608 search results - page 15 / 122
» Interactive Oracle Proofs
Sort
View
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 5 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
SAT
2010
Springer
125views Hardware» more  SAT 2010»
14 years 1 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
FOCS
1999
IEEE
14 years 2 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous
POPL
2001
ACM
14 years 10 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
IWC
2000
106views more  IWC 2000»
13 years 9 months ago
An analysis of errors in interactive proof attempts
The practical utility of interactive, user-guided, theorem proving depends on the design of good interaction environments, the study of which should be grounded in methods of rese...
J. Stuart Aitken, Thomas F. Melham