On sparse oracles separating feasible complexity classes

DOI10.1016/0020-0190(88)90176-7zbMath0658.68055OpenAlexW2088269446MaRDI QIDQ1111385

Juris Hartmanis, Hemaspaandra, Lane A.

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6547

zbMATH Keywords

Kolmogorov complexitypolynomial-time hierarchysparse oracleclasses of languagesP-printabilityrelativationseparating NP from P in worlds where \(P=NP\)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Robust machines accept easy sets ⋮ On the complexity of ranking ⋮ On sets polynomially enumerable by iteration ⋮ Separating complexity classes with tally oracles ⋮ The strong exponential hierarchy collapses ⋮ Structural properties of oracle classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity and structure
• Continuous optimization problems and a polynomial hierarchy of real functions
• Computation times of NP sets of different densities
• Positive Relativizations of Complexity Classes
• Quantitative Relativizations of Complexity Classes
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

This page was built for publication: On sparse oracles separating feasible complexity classes