"P-selective Sets, Tally Languages, and the Behavior of Polynomial Time ..."

Alan L. Selman (1979)

> Home

Details and statistics

DOI: 10.1007/BF01744288

access: closed

type: Journal Article

metadata version: 2020-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Selman79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Selman79
Alan L. Selman:
P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. Math. Syst. Theory 13: 55-65 (1979)

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.