scientific article; zbMATH DE number 4119621

MaRDI QIDQ4733402zbMATH OpenFDO

Authors Ulrich Huckenbeck

Publication date 1989

zbMATH Keywords

Oraclesrandom access machine

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computations with oracles: Generalized selection
• Some Elementary Results About the Equivalence of Computability and Decidability
• Relativizations of the P =? DNP question for the BSS model
• Computations with oracles
• Lower bounds on algebraic random access machines

Cited in

(3)

• Expressing uniformity via oracles
• Equivalence of set- and bag-valued orbits
• The Isomorphism Conjecture Holds Relative to an Oracle

This page was built for publication:

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