scientific article; zbMATH DE number 7075880

MaRDI QIDQ4967176zbMATH OpenFDO

Authors Vikraman Arvind

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/316/298

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 4064489
• On helping by robust oracle machines
• scientific article; zbMATH DE number 3883614
• Robust algorithms: a different approach to oracles
• Types for Proofs and Programs
• On monotonous oracle machines
• scientific article; zbMATH DE number 1775406
• Oracle-based algorithms for binary two-stage robust optimization
• scientific article; zbMATH DE number 3943795
• Oracle-based robust optimization via online learning

Cited in

(6)

• Robust algorithms: a different approach to oracles
• On helping by robust oracle machines
• On helping by parity-like languages
• scientific article; zbMATH DE number 3883614 (Why is no real title available?)
• scientific article; zbMATH DE number 4064489 (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 Q4967176)