Pages that link to "Item:Q1063574"

The following pages link to Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574):

Displaying 29 items.

• Upper bounds on the depth of symmetric Boolean functions (Q264012) (← links)
• Non-uniform automata over groups (Q804303) (← links)
• The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
• Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← 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)
• There are no p-complete families of symmetric Boolean functions (Q1114662) (← 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)
• The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
• Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
• A note on the formula size of the ``mod k'' functions (Q1264165) (← links)
• Threshold circuits of small majority-depth (Q1273878) (← links)
• Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) (Q1322486) (← 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)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• Threshold circuits of bounded depth (Q2366275) (← links)
• (Q3357542) (← links)
• The complexity of symmetric functions in parity normal forms (Q3976033) (← links)
• (Q4036705) (← links)
• On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
• An exact characterization of symmetric functions in \(qAC^{0}[2]\) (Q5941440) (← links)