Category:Circuit complexity
 | Computing portal |
Here is a list of articles in the Circuit complexity category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Circuit complexity"
The following 19 pages are in this category, out of 19 total.
- Circuit complexity (computing)
A
- AC (complexity) (computing)
- AC0 (computing)
- ACC0 (computing)
- Arithmetic circuit complexity (computing)
- Averaging argument (computing)
B
- BIT predicate (computing)
C
- CC (complexity) (computing)
- Circuit (computer science) (computing)
L
- Logic optimization (computing)
- Lupanov representation (computing)
M
- Majority function (computing)
N
- NC (complexity) (computing)
P
- Parity function (computing)
S
- Switching circuit theory (computing)
- Switching lemma (computing)
T
- Tardos function (computing)
- TC (complexity) (computing)
- TC0 (computing)
Mathematics
Organizations
Books
About