On probabilistic quantified satisfiability games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 652-661

  Rychlik, Marcin ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

BOOLEAN VALUES; IRRATIONAL NUMBERS; PARTIAL RESULTS; PROBABILISTIC VARIANT; PSPACE-COMPLETE; SATISFIABILITY;

FORMAL LOGIC;

EID: 35248846082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_59     Document Type: Article

References (12)

1. A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, Journal of the ACM, 28 (1981), pp. 114-133
2. A. Condon, Computational Models od Games, ACM Distinguished Dissertation, MIT Press, Cambridge, 1989
3. A. Condon and R. Ladner, Probabilistic Game Automata, Proceedings of 1st Structure in Complexity Theory Conference, Lecture Notes in Computer Science, vol. 223, Springer, Berlin, 1986, pp. 144-162.
4. J. Feigenbaum, D. Koller, P. Shor, A Game-Theoretic Classification of Interactive Complexity Classes, Proceedings of the 10th Annual IEEE Conference on Structure in Complexity Theory (STRUCTURES), Minneapolis, Minnesota, June 1995, pages 227-237.
5. S. Goldwasser, M. Sipser, Private coins versus public coins in interactive proof systems, Randomness and Computation, S. Micali, editor, vol. 5 of Advances in Computing Research, JAI Press, Greenwich, 1989, pp. 73-90
6. D. Koller, N. Megiddo, The complexity of Two-Person Zero-Sum Games in Extensive Form, Games and Economic Behavior, 4:528-552, 1992
7. D. Koller, N. Megiddo, B. von Stengel Fast Algorithms for Finding Randomized Stragegies in Game Trees, Proceedings of the 26th Symposium on Theory of Computing, ACM, New York, 1994, pp. 750-759
8. R. Lipton, N. Young, Simple strategies for large zero-sum games with applications to complexity theory, Contributions to the Theory of Games II, H. Kuhn, A. Tucker, editors, Princeton University Press, Princeton, 1953, pp. 193-216.
9. C. Papadimitriou, Games Against Nature, Journal of Computer and System Sciences, 31(1985), pp. 288-301
10. C. Papadimitriou, Computational Complexity, Addison-Wesley Pub. Co., 1994
11. C. Papadimitriou, M. Yannakakis, On Complexity as Bounded Rationality, Proceedings of the 26th Symposium on Theory of Computing, ACM, New York, 1994, pp. 726-733
12. M. Rychlik, On Probabilistic Quantified Satisfiability Games, Available at http://www.mimuw.edu.pl/∼mrychlik/papers