|
=== Graphical methods ===
Graphical methods represent the required logical function by a diagram representing the logic variables and value of the function. By manipulating or inspecting a diagram, much tedious calculation may be eliminated.
{{Clean up|date=October 2021|reason=We need more consistent, simpler and prose-like summary on every method. The long-term goal is to have dedicated articles for each of these methods based on the given references.|section}}
Graphical minimization methods for two-level logic include:
* ''[[Euler diagram]]'' (aka ''Eulerian circle'') (1768) by [[Leonhard P. Euler]] (1707–1783)
* ''[[Venn diagram]]'' (1880) by [[John Venn]] (1834–1923)<ref name="Venn_1880_1" /><ref name="Venn_1880_2" />
* ''[[Marquand diagram]]'' (1881) by [[Allan Marquand]] (1853–1924)<ref name="Marquand_1881" /><ref name="Brown_2012" /><!-- a precursor to Karnaugh maps, needs to be covered explicitly here or in a separate article - until then parked here for completeness -->
* {{anchor|Aiken}}''Harvard minimizing chart'' (aka ''Harvard chart'') (1951) by [[Howard H. Aiken]] (1900–1973) and Martha L. Whitehouse of the [[Harvard Computation Laboratory]]<ref name="Aiken_1952" /><ref name="Karnaugh_1953" /><ref name="Phister_1959" /><ref name="Curtis_1962" /><ref name="Föllinger-Weber_1967" />
* {{anchor|Ashenhurst}}''Decomposition chart'' (1952) by Robert L. Ashenhurst (1929–2009) and Theodore Singer (1916–1991)<ref name="Ashenhurst_1952" /><ref name="Singer_1953" /><ref name="Ashenhurst_1953" /><ref name="Curtis_1962" />
* ''[[Veitch chart]]'' (1952) by [[Edward W. Veitch]] (1924–2013)<ref name="Veitch_1952" /><ref name="Brown_2012" /><!-- a precursor to Karnaugh maps, needs to be covered explicitly inhere or in a separate article - until then parked here for completeness -->
* ''[[Karnaugh map]]'' (1953) by [[Maurice Karnaugh]] (1924–)<ref name="Karnaugh_1953" /><ref name="Curtis_1962" />
and many others have been developed.
* {{anchor|Svoboda}}''Contact bones'', ''contact grids'' (1955), and the ''triadic map'' by [[Antonín Svoboda (computer scientist)|Antonín Svoboda]] (1907–1980)<ref name="Svoboda_1955" /><ref name="Svoboda_1956_1" /><ref name="Svoboda_1956_2" /><ref name="Svoboda_1957" /><ref name="Svoboda_1958" /><ref name="McNaughton_1958" /><ref name="Constantinescu_1959" /><ref name="Roginskij_1962" /><!-- Roginskij pp. 99–100 --><ref name="Svoboda_1960" /><ref name="Svoboda_1961" /><ref name="Svoboda_1969" /><ref name="Klír_1968" /><ref name="Steinbuch-Weber_1974" /><ref name="Svoboda_1979" />
* {{anchor|Roginskij}}Graphical method<!-- of contact network design, original based on analytic cascade method by G. N. Povarov --> (1957) by Vadim Nikolaevich Roginskij<!-- GND 1157173993 and 1158776373 --><ref name="Roginskij_1983" /> [{{lang|ru|Вадим Николаевич Рогинский}}] (1913–1983)<ref name="Roginskij_1957_1" /><ref name="Roginskij_1957_2" /><ref name="Roginskij_1958" /><ref name="Roginskij_1962" />
* {{anchor|Händler}}''Händler diagram'' (aka ''Händler circle graph'', {{lang|de|Händler'scher Kreisgraph}}, {{lang|de|Kreisgraph nach Händler}}, {{lang|de|Händler-Kreisgraph}}, {{lang|de|Händler-Diagramm}}, ''{{lang|de|Minimisierungsgraph}}'', ''M<sup>n</sup> graph'') (1958) by [[Wolfgang Händler]] (1920–1998)<ref name="Händler_1958" /><ref name="Colloquium_1960" /><ref name="Steinbuch-Wagner_1967" /><ref name="Steinbuch-Weber_1974" /><ref name="Dokter_1973" /><ref name="Dokter_1975" /><ref name="Klar_1970" /><ref name="Klar_1989" /><ref name="Hotz_1974" /><ref name="ISER_1" /><ref name="ISER_2" /><ref name="Broy_1990" /><ref name="Bauer-Wirsing_1991" />
* {{anchor|Mahoney}}''Mahoney map'' aka ''M-map'' or ''designation numbers'' (1963) by Matthew V. Mahoney<ref name="Peticolas-Mahoney_1963"/><ref name="Peticolas-Mahoney_1964"/><ref name="Peticolas-Mahoney-Laguzzi_1967"/><ref name="RCA_1966"/><ref name="RCA_1968"/><ref name="RCA_1970"/><ref name="Fezer_1970"/><ref name="Moser_1973"/><ref name="Holten_1974"/><ref name="Krehbiel_1996"/><ref name="Mann_2005"/><ref name="Goth_2009"/><ref name="Bonal_2013"/>
* {{anchor|Kortum}}Graph method (1965) by {{ill|Herbert Kortum{{!}}Herbert F. Kortum|de|Herbert Kortum}} (1907–1979)<ref name="Kortum_1965_12"/><ref name="Kortum_1966_1"/><ref name="Kortum_1966_3"/><ref name="Kortum_1965_5"/><ref name="Kortum_1967_6"/><ref name="Kortum_1966_12"/><ref name="Tafel_1971"/><ref name="Axmann_1979"/><ref name="Winkler_2013"/><ref name="Winkler_2019"/>
* {{anchor|RKM|VEM|VEKM|MEV|Schultz|Osborne|Clare|Burgoon|Dornhoff|Fletcher|Rushdi}}''Reduced Karnaugh map'' (RKM)<ref name="Burgoon_1972"/><ref name="Vingron_2003"/><ref name="Vingron_2012"/> techniques aka ''infrequent variables'' (1969) by G. W. Schultz,<ref name="Schultz_1969_1"/><ref name="Schultz_1969_2"/><ref name="Langdon_1974"/> ''map-entered variables'' (MEV, 1969<!-- also 1970, 1972 -->) by [[Tom Osborne (engineer)|Thomas E. Osborne]]<ref name="Schultz_1969_2"/> and Christopher R. Clare,<ref name="Clare_1970"/><ref name="Clare_1973"/><ref name="Muroga_1979"/><ref name="Fletcher_1979"/><ref name="Mano-Ciletti"/><ref name="Green_1986_1"/><ref name="Green_1986_2"/><ref name="McCalla_1992"/><ref name="Vingron_2003"/><ref name="Vingron_2012"/> ''Karnaugh map with letter-name variables'' (1972) by J. Robert Burgoon<ref name="Burgoon_1972"/><ref name="Misra_1992"/> and Larry L.<!-- Lee --> Dornhoff (1942<!-- 1942-04-13 -->–2017<!-- 2017-02-10 https://web.archive.org/web/20210404135116/https://math.illinois.edu/system/files/inline-files/memoriam-dornhoff.pdf -->),<ref name="Muroga_1979"/> ''variable-entered Karnaugh map'' (VEKM, 1983<!-- also 1985, 1987, and later -->) by Ali M. Rushdi (1951<!-- 1951-05-24 -->–),<ref name="Rushdi_1983"/><ref name="Rushdi_1984"/><ref name="Rushdi_1985"/><ref name="Rushdi_1986"/><ref name="Rushdi_1987"/><ref name="Koo_1990"/><ref name="Misra_1992"/> ''variable-entered map'' (VEM) by William I. Fletcher (1938–2020)<ref name="Fletcher_1979"/><ref name="Romero-Aguirre-Murrieta-Lee_2005"/> or ''variable entrant map'' (VEM)<ref name="Malhotra_2019"/>
* {{anchor|Kartalopoulos}}Hypercube method (1982) by Stamatios V. Kartalopoulos<ref name="Kartalopoulos_1982"/>
* {{anchor|McCalla}}''Minterm-ring map'' (MRM) or ''Minterm-ring algorithm'' (1990) by Thomas R. McCalla<ref name="McCalla_1990"/><ref name="McCalla_1992"/><ref name="Morelli-Reynaga_2004"/><ref name="Romero-Aguirre-Murrieta-Lee_2005"/>
* {{anchor|Westphal}}''V diagram'' (2001) by [[Jonathan Westphal]] (1951–)<ref name="Westphal_2001"/><ref name="Westphal_2005"/>
* {{anchor|Verma}}''Paraboomig'' (2003) by Shrish Verma and Kiran D. Permar<ref name="Permar-Verma_2004"/><ref name="Verma_2007"/>
* {{anchor|MIG}}''Majority-inverter graph'' (MIG) (2014) by Luca Amarú, Pierre-Emmanuel Gaillardon and [[Giovanni De Micheli]]<ref name="Amaru_2014"/><ref name="Amaru_2016"/>
* {{anchor|Pandit}}''Pandit plot'' (2017) by Vedhas Pandit and [[Björn W. Schuller]] (1975–)<ref name="Pandit_2017"/>
* {{anchor|Alharbi}}''Truth graph'' (2020) by Eisa Alharbi<ref name="Alharbi_2020_1"/><ref name="Alharbi_2020_2"/>
=== {{Anchor|Circuit minimization in Boolean algebra}}Boolean expression minimization ===
| 