Jisho

×
回路計算量
Links
Wikipedia definition
1. Circuit complexity​In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them. 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.
Read “Circuit complexity” on English Wikipedia
Read “回路計算量” on Japanese Wikipedia
Read “Circuit complexity” on DBpedia

Discussions

to talk about this word.