207 search results - page 9 / 42 » A Temporal Proof System for General Game Playing |
COCO
2010
Springer
15 years 1 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
118
click to vote
PLPV
2012
ACM
13 years 5 months ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...