Pages that link to "Item:Q2362290"
From MaRDI portal
The following pages link to A lower bound for the determinantal complexity of a hypersurface (Q2362290):
Displaying 9 items.
- Sparse systems of parameters for determinantal varieties (Q1384035) (← 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)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- (Q5092471) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)