On problems for which no oracle can help

DOI10.1007/BF02090389zbMath0674.68031OpenAlexW2024403854MaRDI QIDQ3829070

Juraj Hromkovič

Publication date: 1991

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02090389

zbMATH Keywords

computational complexityrelativized computations

Mathematics Subject Classification ID

Related Items (1)

A note on the density of oracle decreasing time-space complexity

Cites Work

• Complexity and structure
• Tradeoffs for language recognition on alternating machines
• Circuit-size lower bounds and non-reducibility to sparse sets
• k + 1 Heads Are Better than k
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On problems for which no oracle can help