scientific article; zbMATH DE number 3932991

MaRDI QIDQ3707953zbMATH OpenFDO

Authors

Publication date 1985

zbMATH Keywords

Approximately solved problemsColumbia UniversityComplexityNew YorkSymposium

Mathematics Subject Classification ID

Conference proceedings and collections of articles (00Bxx) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06)

Cited in

(6)

• A survey of information-based complexity
• Random problems
• Optimal search algorithm for extrema of a discrete periodic bimodal function
• Parallel information-based complexity
• Measures of uncertainty and information in computation
• Certifying smoothness of discrete functions and measuring legitimacy of images

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