Reversible Programming Techniques for Shortest-Path Algorithms.
2018
Reversible computing is so far the only way to circumvent the Landauer limit of CPU power efficiency, thus has attracted more and more attention recently due to its prospect in energy-efficient computing. To make reversible computing possible, much ground work needs to be studied, especially on reversible algorithms. We focus on designing reversible shortest path algorithms in this paper.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI