Pages that link to "Item:Q1182085"
From MaRDI portal
The following pages link to Linear-size constant-depth polylog-threshold circuits (Q1182085):
Displaying 13 items.
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences (Q1007246) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- A slight sharpening of LMN (Q1604204) (← links)
- Identification of partial disjunction, parity, and threshold functions (Q1978506) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
- Deterministic restrictions in circuit complexity (Q4228451) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
