Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP."

Jim Kadin (1989)

> Home

Details and statistics

DOI: 10.1016/0022-0000(89)90024-X

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Kadin89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Kadin89
Jim Kadin:
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. J. Comput. Syst. Sci. 39(3): 282-298 (1989)

a service of

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.