On proving parameterized size lower bounds for multilinear algebraic models

DOI10.1007/978-3-030-26176-4_15zbMath1497.68223OpenAlexW2964064836MaRDI QIDQ2300038

B. V. Raghavendra Rao, Purnata Ghosal

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_15

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: On proving parameterized size lower bounds for multilinear algebraic models