Holographic algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

In computer science, a holographic algorithm is an algorithm – a set of steps – that uses a holographic reduction. A holographic reduction always takes the same amount of time, and makes a big problem easier to solve. Holographic algorithms are not like laser holography, except metaphorically.^[1]

People have used holographic algorithms to find polynomial-time ("efficient") ways to solve problems related to 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. S2CID 2298274.

This short article about technology can be made longer. You can help Wikipedia by adding to it.

[americanscientist-1] 1.0 ^1.1 Hayes, Brian (January–February 2008). "Accidental Algorithms". American Scientist.

[art-2] 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.

[survey-3] 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. S2CID 2298274.

[1]

[2]

[3]