Determinants vs. algebraic branching programs

DOI10.4230/LIPICS.ITCS.2024.27MaRDI QIDQ6906409zbMATH OpenFDO

Authors Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.27

zbMATH Keywords

lower boundsdeterminantsingular varietyalgebraic branching program

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Determinants vs. algebraic branching programs

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