114 search results - page 15 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
FM
2008
Springer
13 years 9 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
BMCBI
2006
13 years 8 months ago
2006
Background: Proteins control and mediate many biological activities of cells by interacting with other protein partners. This work presents a statistical model to predict protein ...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...