Talk:Circuit minimization for Boolean functions: Difference between revisions

Revision as of 00:39, 13 February 2008

Latest revision as of 12:50, 24 December 2024

(10 intermediate revisions by 7 users not shown)

Line 1:

{{WikiProject banner shell|

{{WikiProject Mathematics}}

{{WikiProject Computing|importance=}}

}}

{{merged-to|Logic optimization|date=14 September 2017}}

== "The general problem is NP" ==

Line 10 ⟶ 16:

== Addition of purpose and example ==

I decided to add the "purpose" section to clarify the reason why anyone would want to minimize a circuit in the first place. I also added an example for a circuit using boolean logic and showed that it can be simplified to an XOR gate (the picture was drawn by me, and I think the 'or' and 'xor' gates should be a bit more pointy at the edge but I couldn't draw it so well). <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Uoft ftw|Uoft ftw]] ([[User talk:Uoft ftw|talk]] • [[Special:Contributions/Uoft ftw|contribs]]) 00:3844, 13 February 2008 (UTC)</small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->