External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach

Farid M. Ablayev. Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. In Anil Nerode, Yuri Matiyasevich, editors, Logical Foundations of Computer Science, Third International Symposium, LFCS 94, St. Petersburg, Russia, July 11-14, 1994, Proceedings. Volume 813 of Lecture Notes in Computer Science, pages 1-7, Springer, 1994.

Abstract

Abstract is missing.

runs on