Circuit Value Problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jl pedia (talk | contribs) at 10:53, 19 May 2020 (Fixed another slight grammatical problem in the naming of the Tautology Problem). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Circuit Value Problem (or 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 (or 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 the Boolean Satisfiability Problem which is complete for NP and its complement, the Propositional Tautology Problem, which is complete for co-NP.

References

  1. ^ Buss, Samuel R. (January 1987). "The Boolean formula value problem is in ALOGTIME". www.math.ucsd.edu. Retrieved May 5, 2017.


Stub icon

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

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