Measures of Complexity
DOI10.1007/978-3-319-21852-6zbMATH Open1331.68020OpenAlexW2336529773WikidataQ62046647 ScholiaQ62046647MaRDI QIDQ3449702FDOQ3449702
Authors:
Publication date: 4 November 2015
Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40) Reasoning under uncertainty in the context of artificial intelligence (68T37) Collections of articles of miscellaneous specific interest (00B15) Festschriften (00B30) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of mathematics in the 21st century (01A61)
Cited In (8)
- The fundamental nature of the log loss function
- Three and One Questions to Dr. B. Mirkin About Complexity Statistics
- Matrix and tensor rigidity and \(L_p\)-approximation
- Transit sets of two-point crossover
- Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes
- Transit sets of \(k\)-point crossover operators
- Measures of complexity. Proceedings of the conference, held in Rome, September 30 - October 2, 1987
- Conformal Predictive Distributions with Kernels
This page was built for publication: Measures of Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449702)
