Jump to content

Circuit value problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Adumbrativus (talk | contribs) at 02:49, 11 June 2025 (Adumbrativus moved page Circuit Value Problem to Circuit value problem without leaving a redirect: Requested by Nyq at WP:RM/TR: names of mathematical problems are common nouns and are not capitalized, however a redirect with decapitalized title already exists, so I can't rename it myself). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
An example Boolean circuit

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. 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 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.

See also

References

  1. ^ Samuel R. Buss (Jan 1987). "The Boolean formula value problem is in ALOGTIME". In Alfred V. Aho (ed.). Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC). ACM. pp. 123–131. doi:10.1145/28395.28409. (Author's draft)


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=1295003073"