Revision as of 07:30, 19 August 2007 edit Dfass (talk \| contribs) Extended confirmed users 9,013 edits m →"The general problem is NP" ← Previous edit		Revision as of 00:38, 13 February 2008 edit undo Uoft ftw (talk \| contribs) 15 edits No edit summary Next edit →
Line 8: : Apologies. It's not my field, and I just wrote it off the top of my head (from some dim memory). I changed it now to something possibly better, although I'm hoping that someone who knows the field will swoop in and make it into a real article. —[[User:Dfass\|Dfass]] 07:30, 19 August 2007 (UTC) == 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).

Talk:Circuit minimization for Boolean functions: Difference between revisions