Holographic algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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[change | change source]

  1. 1.0 1.1 Hayes, Brian (January–February 2008). Accidental Algorithms. http://www.americanscientist.org/issues/pub/accidental-algorithms. 
  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. 
  3. Cai, Jin-Yi (June 2008). "Holographic algorithms: guest column". SIGACT News (New York, NY, USA: ACM) 39 (2): 51–81. doi:10.1145/1388240.1388254. ISSN 0163-5700.