External Links

Cite Key

Statistics

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

PDF

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.

A Lower Bound on Complexity of Branching Programs (Extended Abstract)

Pavel Pudlák. A Lower Bound on Complexity of Branching Programs (Extended Abstract). In Michal Chytil, Václav Koubek, editors, Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings. Volume 176 of Lecture Notes in Computer Science, pages 480-489, Springer, 1984.

Abstract

Abstract is missing.

runs on