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

DOI10.1016/0304-3975(94)00072-7zbMath0821.68066OpenAlexW2037569585MaRDI QIDQ1334680

Pavol Ďuriš, José D. P. Rolim

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00072-7

zbMATH Keywords

Turing machinesoracles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• On problems for which no oracle can help
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the density of oracle decreasing time-space complexity