"Honest polynomial reducibilities, recursively enumerable sets, and the ..."

Klaus Ambos-Spies (1987)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-21

- view
  - electronic edition @ ieee.org
- export record
  dblp key:
  - conf/coco/Ambos-Spies87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/Ambos-Spies87
Klaus Ambos-Spies:
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. SCT 1987: 60-68

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.