scientific article; zbMATH DE number 3883614

MaRDI QIDQ3217606zbMATH OpenFDO

Authors Uwe Schöning

Publication date 1984

zbMATH Keywords

polynomial-time algorithmsoracle Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 4064489
• On helping by robust oracle machines
• scientific article; zbMATH DE number 7075880
• scientific article; zbMATH DE number 4172379
• Robust machines accept easy sets

Cited in

(9)

• scientific article; zbMATH DE number 7075880 (Why is no real title available?)
• Robust machines accept easy sets
• On the correctness of orphan management algorithms
• scientific article; zbMATH DE number 4172379 (Why is no real title available?)
• Robust algorithms for restricted domains
• Robust algorithms: a different approach to oracles
• On helping by parity-like languages
• scientific article; zbMATH DE number 4064489 (Why is no real title available?)
• On helping by robust oracle machines

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 Q3217606)