The following pages link to (Q4661386):
Displaying 8 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)
- 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)
