Pages that link to "Item:Q1143790"
From MaRDI portal
The following pages link to Negation can be exponentially powerful (Q1143790):
Displaying 11 items.
- 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)
- 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)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)