Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Circuit complexity
CHF 34.30
Auf Lager
SKU
FP4SNA99PNQ
1 Verfügbar 
Geliefert zwischen Mo., 02.03.2026 und Di., 03.03.2026
Details
High Quality Content by WIKIPEDIA articles! Circuit complexity is a topic in computational complexity theory, a branch of theoretical computer science which classifies Boolean functions according to the amount of computational resources needed to compute them. In circuit complexity, these resources are size and depth of Boolean circuits. A Boolean circuit with n input bits is a directed acyclic graph in which every node (usually called gates in this context) is either an input node of in-degree 0 labeled by one of the n input bits, an AND gate, an OR or a NOT gate. One of these gates is designated as the output gate. Such a circuit naturally computes a function of its n inputs. The size of a circuit is the number of gates it contains and its depth is the maximal length of a path from an input gate to the output gate.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131673030
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- EAN 9786131673030
- Format Kartonierter Einband
- Titel Circuit complexity
- Herausgeber Alphascript Publishing
- Anzahl Seiten 96
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
