skip to main content
article
Free Access

Space-bounded probabilistic game automata

Published:01 April 1991Publication History
First page image

References

  1. 1 BABAI, L. Trading group theory for randomness. In Proceedings of the 17th A CM Symposium on the Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 421-429. Google ScholarGoogle Scholar
  2. 2 BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. Completeness theorems for non-crytographic fault-tolerant distributed computation. In Proceedings of the 20th A CM Symposium on the Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, 1988, pp. 1-10. Google ScholarGoogle Scholar
  3. 3 BRASSARD, G., AND CREPEAU, C Nontransitive transfer of confidence: A perfect-zero knowledge protocol for SAT and beyond. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1986, 188-195.Google ScholarGoogle Scholar
  4. 4 CHANDRA, A. K., KOZEN, D. C., AND STOCKMEYER, L. J. Alternaoon. J. A CM. 28, 1 (Jan. 1981), 114-133. Google ScholarGoogle Scholar
  5. 5 CHAUM, D., CREPEAU, C., AND DAMGARD, I. Multiparty unconditionally secure protocols. In Proceedings of the 20th A CM Symposium on the Theory of Computing (Chicago, Ill., May 2-4), ACM, New York, 1988, 11-19. Google ScholarGoogle Scholar
  6. 6 CONDON, A. :Space bounded probabllistic game automata. In Conference on Structure in Complexity Theory (June). IEEE, New York, 1988, pp. 162-174.Google ScholarGoogle Scholar
  7. 7 CONDON, A.The complexity of stochastic games. Tech. Rep. 863. Univ. Wisconsin-Madison, Madison, Wis., 1989.Google ScholarGoogle Scholar
  8. 8 CONDON, A. Computational Models of Games. MIT Press, Cambridge, Mass., 1989.Google ScholarGoogle Scholar
  9. 9 CONDON, A, AND LADNER, R. Probabilistic game automata. J. Comput. Syst. Sci. 36, 3 (June 1988), 452-489. Google ScholarGoogle Scholar
  10. 10 CONDON, A., AND LIPTON, R. J. On the complexity of space bounded interactive proof systems. In Proceedings of the 30th IEEE Symposium on the Foundauons of Computer Science (Oct.). IEEE, New York, 1989, pp. 462-467.Google ScholarGoogle Scholar
  11. 11 DWORK, C. AND STOCKMEYER, L. Interacnve proof systems with finite state verifiers. Res. Rep. RJ 6262 (61659). IBM Almaden Research Center, San Jose, Calif., 1988.Google ScholarGoogle Scholar
  12. 12 FEIGE, U., FIAT, A., AND SHAMIR, A. Zero knowledge proofs of identity. In Proceedings of the 19th ACM Symposium on the Theory of Computing (New York, N.Y., May 25-27). ACM, New York, 1987, pp. 210-217. Google ScholarGoogle Scholar
  13. 13 FORTNOW, L. Complexity-theoretic aspects of interactive proof systems. Tech. Rep. MIT/LCS/TR-447. MIT, Cambridge, Mass., 1989.Google ScholarGoogle Scholar
  14. 14 FORTNOW, L., AND SIPSER, M. Interactive proof systems with a log space verifier. Manuscript. MIT, Cambridge, Mass., 1988.Google ScholarGoogle Scholar
  15. 15 GAREY. M. R., AND JOHNSON, D. S. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979. Google ScholarGoogle Scholar
  16. 16 GOLDREICH, 0., MICALI, S., AND WIGDERSON, A Proofs that yield nothing but their validity and a methodology of cryptographic design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1986, pp. 174-187.Google ScholarGoogle Scholar
  17. 17 GOLDWASSER, S., AND MICALI, S. Probabflistic encryption and how to play mental poker keeping secret all partial information. In Proceedings of the 14th A CM Symposium on the Theory of Computing (San Francisco, Cahf., May 5-7). ACM, New York, 1982, pp. 365-377. Google ScholarGoogle Scholar
  18. 18 GOLDWASSER, S., MICALI, S., AND RACKOFF, C. The knowledge complexity of interactive proof systems. In Proceedings of the 17th A CM Symposium on the Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 291-304. Google ScholarGoogle Scholar
  19. 19 GOLDWASSER, S., AND SIPSER, M. Private coins versus pubhc coins in interactive proof systems. In Proceedings of the 18th ACM Symposium on the Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, 1986, pp. 59-68. Google ScholarGoogle Scholar
  20. 20 KILLIAN, J. Zero knowledge with log-space verifiers. In Proceedings of the 29th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1988, pp. 25-35.Google ScholarGoogle Scholar
  21. 21 PAPADIMITRIOU, C. H. Games against nature. J Comput. Syst. Sct. 31 (1985), 288-301 Google ScholarGoogle Scholar
  22. 22 PETERSON, G. L., AND REIF, J. H. Multiple person alternation. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science. IEEE, New York, 1979, pp. 348-363.Google ScholarGoogle Scholar
  23. 23 REIF, J H. The complexity of two-player games of incomplete reformation J. Comput. Syst. Sci. 29, 2 (1984), 274-301Google ScholarGoogle Scholar
  24. 24 Ruzzo, W. L., SIMON, J., AND TOMPA, M. Space-bounded hierarchies and probabflistlc computatlons. J. Comput. Sys. Scl. 28, 2 (Apr. 1984), 216-230.Google ScholarGoogle Scholar
  25. 25 SHAPLEY, L. S. Stochastic games. In Proceedings of the National Academy of Sciences, U.S.A. Vol, 39. 1953, pp. 1095-1100.Google ScholarGoogle Scholar
  26. 26 TOMPA, M., AND WOLL, H Random self-reducibility and zero-knowledge interactive proofs of possession of informaUon. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1987, pp. 472-482.Google ScholarGoogle Scholar
  27. 27 VRIEZE, 0. J. Stochastic games with finite state and action spaces, CWI Tract 33. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, I987.Google ScholarGoogle Scholar

Index Terms

  1. Space-bounded probabilistic game automata

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader