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

DOI10.1016/0304-3975(94)00072-7MaRDI QIDQ1334680zbMATH OpenOpenAlexFDO

Authors Pavol Ďuriš, José 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

oraclesTuring machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On problems for which no oracle can help
• scientific article; zbMATH DE number 3992933
• Downward translations of equality
• Relativized circuit complexity
• scientific article; zbMATH DE number 17549

Cites work

• scientific article; zbMATH DE number 4019036 (Why is no real title available?)
• scientific article; zbMATH DE number 58312 (Why is no real title available?)
• On problems for which no oracle can help
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Structural complexity. I

Cited in

(2)

• On problems for which no oracle can help
• A note on zero error algorithms having oracle access to one NP query

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334680)