Pages that link to "Item:Q1143790"
From MaRDI portal
The following pages link to Negation can be exponentially powerful (Q1143790):
Displaying 27 items.
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Integer complexity and well-ordering (Q887902) (← links)
- Complexity of tropical Schur polynomials (Q898243) (← links)
- Monotone separations for constant degree polynomials (Q990088) (← links)
- 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)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- On the relative power of reduction notions in arithmetic circuit complexity (Q1679901) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
- (Q5002654) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121914) (← links)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
