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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1296353848 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.