Towards a predictive computational complexity theory

DOI10.1007/3-540-45465-9_2MaRDI QIDQ4737140zbMATH OpenFDO

Authors Madhav V. Marathe

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800022.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1560216
• Classifying the computational complexity of problems
• scientific article; zbMATH DE number 5217263
• scientific article; zbMATH DE number 863498
• scientific article; zbMATH DE number 218387

Cited in

(6)

• Why it is computationally harder to reconstruct the past than to predict the future
• Predecessor existence problems for finite discrete dynamical systems
• Unresolved computation and optimal predictions
• scientific article; zbMATH DE number 1560216 (Why is no real title available?)
• Asymptotics of predictive stochastic complexity
• Algorithmic complexity bounds on future prediction errors

This page was built for publication: Towards a predictive computational complexity theory

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