Algorithmics -- is there hope for a unified theory? (Invited talk)

DOI10.1007/978-3-642-13182-0_17zbMATH Open1285.68205OpenAlexW1482214671MaRDI QIDQ3569742FDOQ3569742

Authors: Juraj Hromkovič 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_17

Recommendations

• An overview of computational complexity
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• Hardness assumptions in the foundations of theoretical computer science
• Needed: An Empirical Science of Algorithms
• scientific article; zbMATH DE number 2226428

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of algorithms (68W01)

Cited In (2)

• A Modern View on Stability of Approximation
• Needed: An Empirical Science of Algorithms

This page was built for publication: Algorithmics -- is there hope for a unified theory? (Invited talk)

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