"Randomness and Completeness in Computational Complexity"

Dieter van Melkebeek (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44545-5

access: closed

type: Book or Thesis

metadata version: 2019-05-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/Melkebeek00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/Melkebeek00
Dieter van Melkebeek:
Randomness and Completeness in Computational Complexity. Lecture Notes in Computer Science 1950, Springer 2000, ISBN 3-540-41492-4

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.