| dbo:abstract | - 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 (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. 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. (en)
- Das Circuit Value Problem (engl., CVP, dt. etwa: Schaltkreis-Auswertungsproblem) ist in der theoretischen Informatik ein P-vollständiges Problem. (de)
- En informatique théorique, plus précisément en théorie de la complexité, le problème de l'évaluation d'un circuit (appelé CIRCUIT VALUE PROBLEM, CVP, CIRCUIT EVALUATION PROBLEM ou CIRCUIT-EVAL en anglais) est le problème de décision qui consiste à calculer la sortie d'un circuit booléen sur des entrées données. (fr)
|
| dbo:thumbnail | |
| dbo:wikiPageID | |
| dbo:wikiPageLength | - 1420 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID | |
| dbo:wikiPageWikiLink | |
| dbp:wikiPageUsesTemplate | |
| dcterms:subject | |
| rdfs:comment | - Das Circuit Value Problem (engl., CVP, dt. etwa: Schaltkreis-Auswertungsproblem) ist in der theoretischen Informatik ein P-vollständiges Problem. (de)
- En informatique théorique, plus précisément en théorie de la complexité, le problème de l'évaluation d'un circuit (appelé CIRCUIT VALUE PROBLEM, CVP, CIRCUIT EVALUATION PROBLEM ou CIRCUIT-EVAL en anglais) est le problème de décision qui consiste à calculer la sortie d'un circuit booléen sur des entrées données. (fr)
- 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 (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. (en)
|
| rdfs:label | - Circuit Value Problem (de)
- Circuit Value Problem (en)
- Problème de l'évaluation d'un circuit (fr)
|
| owl:sameAs | |
| prov:wasDerivedFrom | |
| foaf:depiction | |
| foaf:isPrimaryTopicOf | |
| isdbo:wikiPageWikiLink of | |
| isfoaf:primaryTopic of | |
