Lesson plan
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 AC reductions. Note that, in terms of time complexity, it can be solved in linear time simply by a topological sort. 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 NC with respect to AC reductions. 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.
Article summary
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 AC reductions. Note that, in terms of time complexity, it can be solved in linear time simply by a topological sort. 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 NC with respect to AC reductions. 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.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.