Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,702,465 papers from all fields of science
Search
Sign In
Create Free Account
Circuit complexity
Known as:
Uniform circuit complexity
, Uniformity (circuit)
, P-nonuniform
Expand
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
49 relations
AC (complexity)
AC0
ACC0
AND gate
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Circuit complexity in quantum field theory
Robert A. Jefferson
,
R. Myers
2017
Corpus ID: 119184784
A bstractMotivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field…
Expand
Highly Cited
2000
Highly Cited
2000
Synthesis and Characterization of Monodisperse Nanocrystals and Close-Packed Nanocrystal Assemblies
C. Murray
,
C. Kagan
,
M. Bawendi
2000
Corpus ID: 53589018
▪ Abstract Solution phase syntheses and size-selective separation methods to prepare semiconductor and metal nanocrystals…
Expand
Highly Cited
1997
Highly Cited
1997
No free lunch theorems for optimization
D. Wolpert
,
W. Macready
IEEE Trans. Evol. Comput.
1997
Corpus ID: 5553697
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A…
Expand
Highly Cited
1994
Highly Cited
1994
Finite Automata, Formal Logic, and Circuit Complexity
Howard Straubing
Progress in Theoretical Computer Science
1994
Corpus ID: 28325156
Part 1 Mathematical preliminaries: words and languages automata and regular languages semigroups and homomorphisms. Part 2 Formal…
Expand
Highly Cited
1994
Highly Cited
1994
Circuit complexity and neural networks
I. Parberry
1994
Corpus ID: 59751066
Computers and computation the discrete neuron the Boolean neuron alternating circuits small, shallow alternating circuits…
Expand
Highly Cited
1993
Highly Cited
1993
Quantum Circuit Complexity
A. Yao
FOCS
1993
Corpus ID: 2870099
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any…
Expand
Review
1993
Review
1993
The polynomial method in circuit complexity
R. Beigel
[] Proceedings of the Eigth Annual Structure in…
1993
Corpus ID: 16952683
The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality…
Expand
Highly Cited
1993
Highly Cited
1993
Cobalt-catalysed growth of carbon nanotubes with single-atomic-layer walls
D. Bethune
,
C. Klang
,
+4 authors
R. Beyers
Nature
1993
Corpus ID: 4321984
CARBON exhibits a unique ability to form a wide range of structures. In an inert atmosphere it condenses to form hollow…
Expand
Highly Cited
1987
Highly Cited
1987
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
R. Smolensky
STOC
1987
Corpus ID: 2214101
We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in…
Expand
Highly Cited
1987
Highly Cited
1987
The monotone circuit complexity of boolean functions
N. Alon
,
R. Boppana
Comb.
1987
Corpus ID: 17397273
Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that cliques in graphs. In particular, Razborov…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE