Computational Complexity over Finite Fields
From MaRDI portal
Publication:4111094
DOI10.1137/0205027zbMath0343.68029OpenAlexW2000641868MaRDI QIDQ4111094
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
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (1)
This page was built for publication: Computational Complexity over Finite Fields