"PNP[log n] and sparse turing complete sets for NP."

Jim Kadin (1987)

Details and statistics

DOI:

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-21

a service of  Schloss Dagstuhl - Leibniz Center for Informatics