scientific article; zbMATH DE number 3883614

zbMATH Open0554.68034MaRDI QIDQ3217606FDOQ3217606

Authors: Uwe Schöning 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial-time algorithmsoracle Turing machine

Mathematics Subject Classification ID

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

Cited In (9)

• Robust machines accept easy sets
• Title not available (Why is that?)
• On the correctness of orphan management algorithms
• Robust algorithms: a different approach to oracles
• On helping by robust oracle machines
• Title not available (Why is that?)
• Robust algorithms for restricted domains
• Title not available (Why is that?)
• On helping by parity-like languages

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)