scientific article; zbMATH DE number 5267

zbMATH Open0795.68072MaRDI QIDQ4712964FDOQ4712964

Authors: Serge Grigorieff 

Publication date: 25 June 1992

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

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

zbMATH Keywords

computational complexityintegrationreal analysisdiscrete complexity theory

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity analysis and its application
• Analysis of the upper bound on the complexity of LLL algorithm
• Algorithm analysis through proof complexity
• Beyond the Worst-Case Analysis of Algorithms
• Weihrauch Complexity in Computable Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)