Years and Authors of Summarized Original Work
2006, 2008; Valiant
2008, 2009, 2010, 2011; Cai, Lu
2009; Cai, Choudhary, Lu
2014; Cai, Gorenstein
Problem Definition
Holographic algorithm, introduced by L. Valiant [11], is an algorithm design technique rather than a single algorithm for a particular problem. In essence, these algorithms are reductions to the FKT algorithm [7–9] to count the number of perfect matchings in a planar graph in polynomial time. Computation in these algorithms is expressed and interpreted through a choice of linear basis vectors in an exponential “holographic” mix, and then it is carried out by the FKT method via the Holant Theorem. This methodology has produced polynomial time algorithms for a variety of problems ranging from restrictive versions of satisfiability, vertex cover, to other graph problems such as edge orientation and node/edge deletion. No polynomial time algorithms were known for these problems, and some minor variations are known to be NP-hard...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Cai JY, Gorenstein A (2014) Matchgates revisited. Theory Comput 10(7):167–197
Cai JY, Lu P (2008) Basis collapse in holographic algorithms. Comput Complex 17(2):254–281
Cai JY, Lu P (2009) Holographic algorithms: the power of dimensionality resolved. Theor Comput Sci Comput Sci 410(18):1618–1628
Cai JY, Lu P (2010) On symmetric signatures in holographic algorithms. Theory Comput Syst 46(3):398–415
Cai JY, Lu P (2011) Holographic algorithms: from art to science. J Comput Syst Sci 77(1):41–61
Cai JY, Choudhary V, Lu P (2009) On the theory of matchgate computations. Theory Comput Syst 45(1):108–132
Kasteleyn PW (1961) The statistics of dimers on a lattice. Physica 27:1209–1225
Kasteleyn PW (1967) Graph theory and crystal physics. In: Harary F (ed) Graph theory and theoretical physics. Academic, London, pp 43–110
Temperley HNV, Fisher ME (1961) Dimer problem in statistical mechanics – an exact result. Philos Mag 6:1061–1063
Valiant LG (2006) Accidental algorthims. In: FOCS ’06: proceedings of the 47th annual IEEE symposium on foundations of computer science. IEEE Computer Society, Washington, pp 509–517. doi:http://dx.doi.org/10.1109/FOCS.2006.7
Valiant LG (2008) Holographic algorithms. SIAM J Comput 37(5):1565–1594. doi:http://dx.doi.org/10.1137/070682575
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Cai, JY., Lu, P., Xia, M. (2016). Holographic Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_746
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_746
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering