Holographic algorithm
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.
- ↑ Lua error in Module:Citation/CS1/Identifiers at line 630: attempt to index field 'known_free_doi_registrants_t' (a nil value).
- ↑ Lua error in Module:Citation/CS1/Identifiers at line 630: attempt to index field 'known_free_doi_registrants_t' (a nil value).
