Pages that link to "Item:Q1063574"
From MaRDI portal
The following pages link to Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574):
Displayed 18 items.
- Non-uniform automata over groups (Q804303) (← links)
- Reversal complexity revisited (Q935164) (← links)
- Generalized lower bounds derived from Hastad's main lemma (Q1107987) (← links)
- The complexity of symmetric functions in bounded-depth circuits (Q1107989) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Construction of universal enumerators and formulas for threshold functions (Q1121855) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- Properties of symmetric Boolean functions (Q1670318) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- An exact characterization of symmetric functions in \(qAC^{0}[2]\) (Q5941440) (← links)