Sciweavers

Share
COCO
1994
Springer
102views Algorithms» more  COCO 1994»
8 years 8 months ago
Alternation in Interaction
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
Marcos A. Kiwi, Carsten Lund, Alexander Russell, D...
STACS
1997
Springer
8 years 8 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
8 years 8 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
8 years 8 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
TAMC
2010
Springer
8 years 9 months ago
Optimal Acceptors and Optimal Proof Systems
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
Edward A. Hirsch
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
8 years 9 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
COCO
2003
Springer
102views Algorithms» more  COCO 2003»
8 years 9 months ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
8 years 10 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
8 years 10 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
CSL
2007
Springer
8 years 10 months ago
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
Chuck Liang, Dale Miller
books