scientific article; zbMATH DE number 5267

MaRDI QIDQ4712964zbMATH OpenFDO

Authors Serge Grigorieff

Publication date 25 June 1992

zbMATH Keywords

computational complexitydiscrete complexity theoryintegrationreal analysis

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The computational complexity of maximization and integration
• scientific article; zbMATH DE number 4110107
• Computational complexity on numerical integrals
• scientific article; zbMATH DE number 4129391
• Theory and Applications of Models of Computation

Cited in

(11)

• Complexity analysis and its application
• Algorithm analysis through proof complexity
• Analysis of the upper bound on the complexity of LLL algorithm
• Complexity of integration, special values, and recent developments
• scientific article; zbMATH DE number 3887066 (Why is no real title available?)
• scientific article; zbMATH DE number 4091783 (Why is no real title available?)
• scientific article; zbMATH DE number 4110107 (Why is no real title available?)
• scientific article; zbMATH DE number 2087550 (Why is no real title available?)
• Weihrauch Complexity in Computable Analysis
• Beyond the Worst-Case Analysis of Algorithms
• Analytic analysis of algorithms

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