Holographic algorithm
In computer science, a holographic algorithm is an algorithm (set of steps) that uses a holographic reduction – a constant-time reduction (set of steps that always take the same amount of time and make a big problem easier to solve). Leslie Valiant came up with the idea. The algorithms are not like laser holography, except metaphorically. [1]
People have used holographic algorithms to find polynomial-time ("efficient") ways to solve problems that involve mathematical graphs like satisfiability.[2] Holographic algorithms may be connected to the P versus NP problem[1] or computational complexity theory.
Holographic algorithms are like quantum computation in some ways, but they work with completely normal computers. [3]
References
- ↑ 1.0 1.1 Hayes, Brian (January–February 2008). "Accidental Algorithms". American Scientist.
- ↑ Cai, Jin-Yi; Lu, Pinyan (2011). "Holographic algorithms: From art to science". J. Comput. Syst. Sci. 77 (1): 41–61. doi:10.1016/j.jcss.2010.06.005.
- ↑ Cai, Jin-Yi (June 2008). "Holographic algorithms: guest column". SIGACT News. 39 (2). New York, NY, USA: ACM: 51–81. doi:10.1145/1388240.1388254. ISSN 0163-5700.