Pages that link to "Item:Q1276316"
From MaRDI portal
The following pages link to A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316):
Displaying 7 items.
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755) (← links)
- Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465877) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)