Pages that link to "Item:Q1333269"

The following pages link to Depth reduction for circuits of unbounded fan-in (Q1333269):

Displaying 28 items.

• A note on the power of majority gates and modular gates (Q673905) (← links)
• On learning embedded midbit functions (Q817826) (← links)
• Rudimentary reductions revisited (Q1183444) (← links)
• Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
• Relating polynomial time to constant depth (Q1274992) (← links)
• Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← links)
• Improved depth lower bounds for small distance connectivity (Q1293359) (← links)
• When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
• Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
• On ACC (Q1346616) (← links)
• Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
• On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
• Quantum neural networks (Q1604195) (← links)
• A slight sharpening of LMN (Q1604204) (← links)
• The size and depth of layered Boolean circuits (Q1944075) (← links)
• Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
• Uniform proofs of ACC representations (Q2402964) (← links)
• Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
• Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
• Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
• Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
• Depth Reduction for Composites (Q4634033) (← links)
• A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
• Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
• (Q5368765) (← links)
• Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (Q5415496) (← links)
• Relations among parallel and sequential computation models (Q6560351) (← links)
• Circuit complexity before the dawn of the new millennium (Q6567750) (← links)