scientific article
From MaRDI portal
Publication:3798224
zbMath0652.68033MaRDI QIDQ3798224
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
Inversion in finite fields using logarithmic depth, Boolean circuits versus arithmetic circuits, Complexity of computation in finite fields, A div(n) depth Boolean circuit for smooth modular inverse