"Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Juris Hartmanis (1993)

> Home

Details and statistics

DOI: 10.1142/9789812794499_0029

access: closed

type: Part in Book or Collection

metadata version: 2017-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - series/wsscs/Hartmanis93b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/wsscs/Hartmanis93b
Juris Hartmanis:
Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy. Current Trends in Theoretical Computer Science 1993: 403-411

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.