Pages that link to "Item:Q1143790"
From MaRDI portal
The following pages link to Negation can be exponentially powerful (Q1143790):
Displayed 7 items.
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Lower bounds on monotone arithmetic circuits with restricted depths (Q1070999) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)