Keyword

circuit complexity

Description: Circuit complexity is a branch of computational complexity theory that studies the resources, such as circuit size and depth, needed to compute functions.

Primary topic: Complexity and Algorithms in Graphs (46%)

Wikidata ID: wiki/Q1055112

OpenAlex ID: keywords/circuit-complexity

Elementary gates for quantum computation

1995 · Adriano Barenco, Charles H. Bennett, et al. · Physical Review A · 4,308

PDF

The Complexity of Boolean Functions

1987 · Ingo Wegener · 888

Structural Complexity I

1988 · José Luis Balcázar, Josep Díaz, et al. · Texts in theoretical computer science · 866

Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1

1986 · D A Barrington · 669

Some connections between nonuniform and uniform complexity classes

1980 · Richard M. Karp, Richard J. Lipton · ACM Symposium on Theory of Computing (STOC) · 587

PDF

Computational Complexity: ADVANCED TOPICS

2009 · Sanjeev Arora, Boaz Barak · 576

P = BPP if E requires exponential circuits

1997 · Russell Impagliazzo, Avi Wigderson · ACM Symposium on Theory of Computing (STOC) · 535

Interneuron Diversity series: Circuit complexity and axon wiring economy of cortical interneurons

2004 · György Buzsáki, Caroline Geisler, et al. · Trends in Neurosciences · 492

Circuit complexity in quantum field theory

2017 · Robert A. Jefferson, Robert C. Myers · Journal of High Energy Physics · 475

PDF

Computational limitations of small-depth circuits

1987 · Johan Torkel Håstad · DSpace@MIT (Massachusetts Institute of Technology) · 447

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

1989 · David A. Barrington · Journal of Computer and System Sciences · 429

Finite Automata, Formal Logic, and Circuit Complexity

1994 · Howard Straubing · Birkhäuser Boston eBooks · 406

Introduction to Circuit Complexity

1999 · Heribert Vollmer · Texts in theoretical computer science · 383

Two theorems on random polynomial time

1978 · Leonard Adleman · Annual Symposium on Foundations of Computer Science · 322

Adder Designs and Analyses for Quantum-Dot Cellular Automata

2007 · Heumpil Cho, Earl E. Swartzlander · IEEE Transactions on Nanotechnology · 314

The duobinary technique for high-speed data transmission

1963 · Adam Lender · IEEE Transactions on Communication and Electronics · 296

Introduction to Circuit Complexity : A Uniform Approach

2014 · Heribert Vollmer · 295

Constant Depth Reducibility

1984 · Ashok K. Chandra, Larry Stockmeyer, et al. · SIAM Journal on Computing · 293

Second law of quantum complexity

2018 · Adam R. Brown, Leonard Susskind · Physical review. D/Physical review. D. · 292

PDF

Chaos, complexity, and random matrices

2017 · Jordan Cotler, Nicholas Hunter-Jones, et al. · Journal of High Energy Physics · 266

PDF

Circuit complexity for free fermions

2018 · Lucas Hackl, Robert C. Myers · Journal of High Energy Physics · 264

PDF

Introduction to Formal Hardware Verification

1999 · Thomas Kropf · Springer eBooks · 242

BQP and the polynomial hierarchy

2010 · Scott Aaronson · ACM Symposium on Theory of Computing (STOC) · 229

Complexity Issues in VLSI

1983 · F. Thomas Leighton · 226

Pseudorandom generators for space-bounded computations

1990 · N. Nisan · ACM Symposium on Theory of Computing (STOC) · 222

Works count: 3,054

Citation count: 38,590