"Polynomial Time Enumeration Reducibility."

Alan L. Selman (1978)

> Home

Details and statistics

DOI: 10.1137/0207035

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Selman78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Selman78
Alan L. Selman:
Polynomial Time Enumeration Reducibility. SIAM J. Comput. 7(4): 440-457 (1978)

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.