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.

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Scott Diehl, Dieter van Melkebeek. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. In Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek, editors, Complexity of Boolean Functions, 12.03. - 17.03.2006. Volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [doi]

Abstract

Abstract is missing.

runs on