Content deleted Content added
|
|
|
Boolean function minimizing methods include:
* [[Archie Blake (mathematician)|Blake]]–[[Platon Poretsky|Poretsky]] method
* [[Nelson method]]<ref name="Nelson_1955_1"/><ref name="Nelson_1955_2"/><ref name="Lipp_2011"/><ref name="Riznyk_2017"/><ref name="Riznyk_2018"/>
* [[Quine–McCluskey algorithm]]
* Method of algebraic transformations
* [[Petrick's method]]
* Roth method<ref name="Roth_1957"/><ref name="Roth_1958"/><ref name="Roth_1960"/>
* Kudielka method<ref name="Kudielka_1960"/><ref name="Kudielka_1961"/><ref name="Kudielka_1962"/>
* Wells method<ref name="Wells_1962"/>
* {{anchor|Scheinman}}Scheinman's binary method<ref name="Scheinman_1962"/><ref name="Föllinger-Weber_1967"/>
* a method of minimizing functions in bases YES-NO and OR-NOT (Schaeffer and Pierce basis)
* method of undetermined coefficients
* hypercube method
* functional decomposition method
=== Espresso heuristic logic minimizer ===
|
