A lower bound on determinantal complexity

DOI10.4230/LIPICS.CCC.2021.4MaRDI QIDQ6115355FDOQ6115355

Authors: Mrinal Kumar, Ben Lee Volk 

Publication date: 12 July 2023

Recommendations

• A lower bound on determinantal complexity
• Lower bounds for the determinantal complexity of explicit low degree polynomials
• Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
• scientific article; zbMATH DE number 2151804
• A lower bound for the determinantal complexity of a hypersurface

zbMATH Keywords

lower boundssingular varietyalgebraic circuitsdeterminantal complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Lower bounds for some decision problems over \(C\)
• Lower bounds for Haar projections: deterministic examples
• Undirected determinant and its complexity
• A nonlinear lower bound on the practical combinational complexity

This page was built for publication: A lower bound on determinantal complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115355)