NONDETERMINISTICALLY SELECTIVE SETS

From MaRDI portal

Revision as of 04:21, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4867411

Jump to:navigation, search

DOI10.1142/S0129054195000214zbMath0843.68031MaRDI QIDQ4867411

Selman, Alan L., Ashish V. Naik, Albrecht Hoene, Hemaspaandra, Lane A., Ogihara, Mitsunori, Thomas Thierauf, Jie Wang

Publication date: 13 August 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-selective sets

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Nondeterministic functions and the existence of optimal proof systems ⋮ The shrinking property for NP and coNP ⋮ The Boolean hierarchy of NP-partitions ⋮ ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES ⋮ On the reducibility of sets inside NP to sets with low information content ⋮ Competing provers yield improved Karp-Lipton collapse results ⋮ Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

This page was built for publication: NONDETERMINISTICALLY SELECTIVE SETS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4867411&oldid=19227673"