Wikipedia

Circuit satisfiability problem

This is an old revision of this page, as edited by The Anome (talk | contribs) at 10:31, 4 February 2012 (== References == {{reflist}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Circuit satisfiability is an NP-complete mathematical problem related to Boolean circuits.[1]

References

  1. ^ David Mix Barrington and Alexis Maciel (July 5, 2000). "Lecture 7: NP-Complete Problems" (PDF).

See also

 

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

 

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Circuit_satisfiability_problem&oldid=474933768"