"Optimal proof systems imply complete sets for promise classes."

Johannes Köbler, Jochen Messner, Jacobo Torán (2003)

> Home

Details and statistics

DOI: 10.1016/S0890-5401(03)00058-0

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/KoblerMT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/KoblerMT03
Johannes Köbler, Jochen Messner, Jacobo Torán:
Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003)

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.