Revision as of 11:17, 4 February 2012 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,268 edits trim unneeded headword ← Previous edit		Revision as of 11:17, 4 February 2012 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,268 edits rm comma Next edit →
Line 1: {{expert-subject\|Computer Science}} In theoretical computer science, the '''circuit satisfiability problem''' (also known as '''CIRCUIT-SAT''', or '''CSAT''') is a [[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> It is [[NP-complete]].<ref>{{cite web\|url=http://www.cs.berkeley.edu/~luca/cs170/notes/lecture22.pdf\|title=Notes for Lecture 23: NP-completeness of Circuit-SAT\|author=Luca Trevisan\|date=November 29. 2001}}</ref> == References ==

Circuit satisfiability problem: Difference between revisions