"Query complexity, or why is it difficult to seperate NP A cap ..."

Gábor Tardos (1989)

> Home

Details and statistics

DOI: 10.1007/BF02125350

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Tardos89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Tardos89
Gábor Tardos:
Query complexity, or why is it difficult to seperate NP ^A cap co NP^A from P^A by random oracles A?. Comb. 9(4): 385-392 (1989)

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.