Lower bounds for special cases of syntactic multilinear ABPs

DOI10.1007/978-3-319-94776-1_58zbMath1436.68128arXiv1804.08810OpenAlexW2963732279MaRDI QIDQ5916261

C. Ramya, B. V. Raghavendra Rao

Publication date: 4 October 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08810

zbMATH Keywords

computational complexityalgebraic branching programsalgebraic complexity theory

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Unnamed Item ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ Limitations of sums of bounded read formulas and ABPs

This page was built for publication: Lower bounds for special cases of syntactic multilinear ABPs