Some more independence results in complexity theory

DOI10.1016/0304-3975(80)90024-9zbMath0447.68041OpenAlexW2086060278MaRDI QIDQ1146514

Philip W. Grant

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90024-9

zbMATH Keywords

independencecomplete sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Unnamed Item

This page was built for publication: Some more independence results in complexity theory