Algorithm analysis through proof complexity

DOI10.1007/978-3-319-94418-0_26MaRDI QIDQ1670749zbMATH OpenOpenAlexWikidataFDO

Authors Massimo Lauria

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_26

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 5267
• scientific article; zbMATH DE number 18900
• scientific article; zbMATH DE number 976346
• scientific article; zbMATH DE number 3420721
• Analytic analysis of algorithms
• Algorithmic complexity
• scientific article; zbMATH DE number 2212138
• Proof Complexity
• Practical analysis of algorithms
• scientific article; zbMATH DE number 4053608

Cited in

(4)

• Thinking algorithmically about impossibility (invited talk)
• Algorithms for circuits and circuits for algorithms: connecting the tractable and intractable
• An analysis of the WITT algorithm
• scientific article; zbMATH DE number 512976 (Why is no real title available?)

This page was built for publication: Algorithm analysis through proof complexity

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