Circuit Value Problem
id:
circuit-value-problem-283-10357061
title:
Circuit Value Problem
text:
The Circuit Value 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 is the special case of the problem when the circuit is a tree. The Boolean Formula Value Problem is complete for NC1. The problem is closely related to the Boolean Satisfiability P
brand slug:
wiki
category slug:
encyclopedia
description:
Computational problem
original url:
https://en.wikipedia.org/wiki/Circuit_Value_Problem
date created:
date modified:
2023-09-02T00:09:01Z
main entity:
{"identifier":"Q1092835","url":"https://www.wikidata.org/entity/Q1092835"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/a2/Combinatorial_Logic_Example.svg","width":452,"height":182}
fields total:
13
integrity:
15