"Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized ..."

Scott Diehl, Dieter van Melkebeek (2006)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-23

- view
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/DiehlM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/DiehlM06
Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Complexity of Boolean Functions 2006

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.