Circuit Value Problem

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 Propositional Tautologihood Problem which is complete for co-NP.


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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.