Computational proof as experiment: probabilistic algorithms from a thermodynamic perspective

DOI10.1007/B12001MaRDI QIDQ5305655zbMATH OpenOpenAlexFDO

Authors Krishna Palem

Publication date 23 March 2010

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

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Energy-efficient algorithms
• An energy complexity model for algorithms
• Towards an energy complexity of computation
• On the statistical thermodynamics of reversible communicating processes
• scientific article; zbMATH DE number 4068261

Cited in

(5)

• All shook up: fluctuations, Maxwell's demon and the thermodynamics of computation
• Energy-efficient algorithms
• An energy complexity model for algorithms
• The arrow of time through the lens of computing
• Algorithmic thermodynamics

This page was built for publication: Computational proof as experiment: probabilistic algorithms from a thermodynamic perspective

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