On relativized probabilistic polynomial time algorithms

DOI10.2969/JMSJ/04910015zbMath0899.68051OpenAlexW2037181336MaRDI QIDQ1389852

Masafumi Kudoh, Hisao Tanaka

Publication date: 10 November 1998

Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2969/jmsj/04910015

zbMATH Keywords

polynomial time algorithmsrecursive oracle

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (2)

Alternative proof for the localization of Sinai's walk ⋮ Complexity of the \(r\)-query tautologies in the presence of a generic oracle

This page was built for publication: On relativized probabilistic polynomial time algorithms