Jump to content

Circuit value problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 74.215.209.17 (talk) at 23:13, 9 July 2016 (Added stub template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Circuit Value Problem (aka. the Circuit Evaluation Problem) is the computational problem of computing the output of a given Boolean circuit on a given input.

The problem is complete for P under uniform AC0 reductions. The Boolean Formula Value Problem (aka. Boolean Formula Evaluation Problem) is the special case of the problem when the circuit is a tree. The Boolean Formula Value Problem is complete for NC1[1]

The problem is closely related to Boolean Satisfiability Problem which is complete for NP and its complement Propositional Tautologihood Problem which is complete for coNP.

Stub icon

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

References

  1. ^ Samuel, Buss. "Boolean formula value problem (BFVP) in Alogtime". www.math.ucsd.edu. Retrieved 3 April 2016.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Circuit_value_problem&oldid=729107887"