Computational Complexity over Finite Fields

DOI10.1137/0205027MaRDI QIDQ4111094zbMATH OpenOpenAlexFDO

Authors Volker Strassen

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205027

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(1)

• Lower bounds in algebraic computational complexity

This page was built for publication: Computational Complexity over Finite Fields

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