The following pages link to (Q4661386):
Displaying 31 items.
- Binary determinantal complexity (Q286175) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- On the optimality of the Arf invariant formula for graph polynomials (Q610678) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Geometric complexity theory and matrix powering (Q1679673) (← links)
- Ulrich complexity (Q1679674) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Vanishing symmetric Kronecker coefficients (Q2181688) (← links)
- Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- Linear projections of the Vandermonde polynomial (Q2330107) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- A lower bound for the determinantal complexity of a hypersurface (Q2362290) (← links)
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629) (← links)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
