Definition
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 the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits .
Related concepts
AC0ACC0AC (complexity)AND gateAbstract machineAleksandr Aleksandrovich RazborovAlexander RazborovAssociation for Computing MachineryAverage-case complexityB. G. Teubner VerlagBell System Technical JournalBenjamin E. RossmanBenjamin RossmanBitBoolean circuitBoolean functionCircuit minimizationClaude Elwood ShannonClaude ShannonClique problemCombinatoricaComplexity classComputational complexity theoryComputational problemComputational resourceDLOGTIMEDagstuhlDerandomizationDeterministic Turing machineDirected acyclic graphElectronic Colloquium on Computational ComplexityEndre SzemerédiEric AllenderFan-inFormal languageIn-degreeIngo WegenerJames Benjamin SaxeJohan HåstadJohan Torkel HåstadJohn Wiley & Sons Ltd.Journal of Computer and System SciencesJournal of the ACMJános Komlós (mathematician)Karp-Lipton theoremLog-space reductionLog-space transducerMA (complexity)Machine that always haltsMathematical Systems TheoryMichael Fredric SipserMichael J. FischerMichael SipserMiklós AjtaiNC1 (complexity)NC (complexity)NEXPTIMENOT gateNP (complexity)Natural proofNick PippengerNoga AlonOR gateP/polyPP (complexity)P (complexity)Parity functionPermanent (mathematics)Pierre McKenzieRan RazRecursive languageRichard Ryan WilliamsRussell Graham ImpagliazzoRyan Williams (computer scientist)Soviet Mathematics - DokladySpringer VerlagSteven RudichTC0Theoretical computer scienceTuring machineTuring machine equivalentsUri Zwick
9 concepts already in your glossary