Pages that link to "Item:Q1590079"
From MaRDI portal
The following pages link to Exponential lower bounds for depth three Boolean circuits (Q1590079):
Displayed 4 items.
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- Subset sum ``cubes'' and the complexity of primality testing (Q1885040) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)