Live briefing
Everything about Circuit complexity
Model of computational 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 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Circuit complexityA 5-minute orientation
- Skim a recent paper: α7 nicotinic acetylcholine receptors in the hippocampal circuit: taming complexityInfluential work since 2022
- Pick up a classic book: Circuit complexity and neural networksThe most-reprinted book on the subject
- Read the landmark paper: Circuit complexity in quantum field theoryCited 413 times
- Go sideways: ACC0A closely related topic
- Go sideways: Arithmetic circuit complexityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Circuit complexity in quantum field theory
On uniform circuit complexity
The monotone circuit complexity of boolean functions
Circuit complexity for free fermions
Circuit complexity in fermionic field theory
Linear growth of quantum circuit complexity
Circuit complexity for coherent states
Coding complexity in the human motor circuit
🆕 Influential since 2022
α7 nicotinic acetylcholine receptors in the hippocampal circuit: taming complexity
Cell and circuit complexity of the external globus pallidus
Variational quantum eigensolver with reduced circuit complexity
Krylov complexity and Trotter transitions in unitary circuit dynamics
Circuit complexity of quantum access models for encoding classical data
📚 Books worth reading
Circuit complexity and neural networksIan Parberry · 1994
Communication complexityEyal Kushilevitz, Noam Nisan · 2006
Complex Hamiltonian dynamicsTassos Bountis · 2012
Information-Spectrum Methods in Information TheoryTe Sun Han, H. Koga · 2010
Multidimensional Queueing Models in Telecommunication NetworksAgassi Melikov, Leonid Ponomarenko · 2014
Complex Time-Delay SystemsFatihcan M. Atay · 2010
Complex Computing-NetworksLevent Sevgi · 2006
Computation structuresStephen A. Ward · 1990
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- ACC0 ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The…
- Arithmetic circuit complexity In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as inputs…
- AC (complexity) In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth O ( log…
- TC0 In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in…
- Circuit (computer science) In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes…
- NC (complexity) Unsolved problem in computer science 𝖭𝖢=?𝖯 More unsolved problems in computer science In computational complexity theory, the class NC (for Nick's…
- TC (complexity) In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC (Threshold Circuit) is a complexity class…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…