Pages that link to "Item:Q1232179"
From MaRDI portal
The following pages link to A lower bound on the number of additions in monotone computations (Q1232179):
Displaying 24 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)
- The complexity of computing the permanent (Q600247) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Integer complexity and well-ordering (Q887902) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- A note on 'Is shortest path problem not harder than matrix multiplication?' (Q1158968) (← links)
- A lower bound on the number of additions in monotone computations (Q1232179) (← links)
- A note on Schnorr's separatedness (Q1238422) (← links)
- Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896) (← links)
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918) (← links)
- A counterexample to a conjecture of Schnorr referring to monotone networks (Q1255472) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
- Minkowski Complexity of Sets: An Easy Lower Bound (Q4575425) (← links)
- (Q5121914) (← links)
- Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)
