"How reductions to sparse sets collapse the polynomial-time hierarchy: a ..."

Paul Young (1992)

> Home

Details and statistics

DOI: 10.1145/141914.141921

access: closed

type: Journal Article

metadata version: 2019-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigact/Young92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigact/Young92
Paul Young:
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions. SIGACT News 23(3): 107-117 (1992)

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.