Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Circuit complexity

Known as: Uniform circuit complexity, Uniformity (circuit), P-nonuniform 
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified… Expand
Wikipedia

Related topics

Related topics

49 relations
AC (complexity)AC0ACC0AND gate
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Pt-Based electrocatalysts with high atom utilization efficiency: from nanostructures to single atoms
In recent years, development to increase the performance of Pt-based catalysts and reduce the cost has received significant… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2019
Review
2019
Coverage protocols for wireless sensor networks: Review and future directions
The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Review
2018
Review
2018
Applied Psychometrics: Sample Size and Sample Power Considerations in Factor Analysis (EFA, CFA) and SEM in General
Adequate statistical power contributes to observing true relationships in a dataset. With a thoughtful power analysis, the… Expand
  • table 1
  • figure 1
  • figure 2
  • table 3
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Introduction to Circuit Complexity: A Uniform Approach
From the Publisher: This advanced handbook presents a broad and up-to-date view of the computational complexity theory of… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Synthesis and Characterization of Monodisperse Nanocrystals and Close-Packed Nanocrystal Assemblies
▪ Abstract Solution phase syntheses and size-selective separation methods to prepare semiconductor and metal nanocrystals… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
No free lunch theorems for optimization
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Finite Automata, Formal Logic, and Circuit Complexity
Part 1 Mathematical preliminaries: words and languages automata and regular languages semigroups and homomorphisms. Part 2 Formal… Expand
Is this relevant?
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
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The monotone circuit complexity of boolean functions
Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that cliques in graphs. In particular, Razborov… Expand
Is this relevant?
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