Pages that link to "Item:Q300885"
From MaRDI portal
The following pages link to Complexity of linear circuits and geometry (Q300885):
Displaying 6 items.
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- Algebraic compressed sensing (Q6042618) (← links)
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559) (← links)