Complexity of some arithmetic problems for binary polynomials

DOI10.1007/S00037-003-0176-9zbMath1084.68053OpenAlexW1973269337MaRDI QIDQ1889852

Igor E. Shparlinski, Joachim von zur Gathen, Anna Bernasconi, Carsten Damm, Eric W. Allender, Michael E. Saks

Publication date: 13 December 2004

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-003-0176-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Mutually orthogonal Latin squares based on cellular automata

This page was built for publication: Complexity of some arithmetic problems for binary polynomials