Revision as of 10:37, 4 February 2012 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,268 edits {{expert-subject\|Computer Science}} ← Previous edit		Revision as of 10:41, 4 February 2012 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,268 edits an NP-complete decision problem Next edit →
Line 1: {{expert-subject\|Computer Science}} '''Circuit satisfiability''' is an [[NP-complete]] ~~mathematical~~[[decision problem]] related to [[Boolean circuit]]s.<ref>{{cite web\|url=http://people.clarkson.edu/~alexis/PCMI/Notes/lectureB07.pdf\|title=Lecture 7: NP-Complete Problems\|date=July 5, 2000\|author=David Mix Barrington and Alexis Maciel}}</ref> == References ==

Circuit satisfiability problem: Difference between revisions