"The relative complexity of NP search problems."

Paul Beame et al. (1995)

> Home

Details and statistics

DOI: 10.1145/225058.225147

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/BeameCEIP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BeameCEIP95
Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi:
The relative complexity of NP search problems. STOC 1995: 303-314

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.