scientific article; zbMATH DE number 4064489

MaRDI QIDQ3798241zbMATH OpenFDO

Authors Uwe Schöning

Publication date 1988

zbMATH Keywords

interactive proof systemslownessNP problemsoracle setrobust oracle machineself-reducibilitystructural complexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 7075880
• On helping by robust oracle machines
• scientific article; zbMATH DE number 3883614
• Robust algorithms: a different approach to oracles
• On monotonous oracle machines
• Effective oracles
• Computations with oracles
• On one application of computations with oracle
• Oracle-based robust optimization via online learning

Cited in

(8)

• On helping by robust oracle machines
• Strong and robustly strong polynomial-time reducibilities to sparse sets
• scientific article; zbMATH DE number 4172379 (Why is no real title available?)
• scientific article; zbMATH DE number 3883614 (Why is no real title available?)
• On problems for which no oracle can help
• Fault-tolerance and complexity (extended abstract)
• scientific article; zbMATH DE number 7075880 (Why is no real title available?)
• Robust machines accept easy sets

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