Revision as of 02:50, 31 May 2022 edit Wtshymanski (talk \| contribs) Extended confirmed users 76,265 edits →{{Anchor\|Circuit minimization in Boolean algebra}}Boolean expression minimization: get rid of references to primary sources Tag: Reverted ← Previous edit		Revision as of 02:53, 31 May 2022 edit undo Wtshymanski (talk \| contribs) Extended confirmed users 76,265 edits removing cites of primary sources Tag: Reverted Next edit →
Line 38: 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" />~~ * ''[[Karnaugh map]]'' (1953) by [[Maurice Karnaugh]] ~~(1924–)<ref name="Karnaugh_1953" /><ref name="Curtis_1962" />~~ ~~and many others have been developed.~~ === {{Anchor\|Circuit minimization in Boolean algebra}}Boolean expression minimization ===

Logic optimization: Difference between revisions