The parallel complexity of exponentiating polynomials over finite fields

DOI10.1145/44483.44496MaRDI QIDQ3798223zbMATH OpenOpenAlexFDO

Authors Martin Tompa, Faith E. Fich

Publication date 1988

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/44483.44496

zbMATH Keywords

\(NC^ 2\)algebraic complexitymodular polynomial exponentiationparallel algorithmpolynomials over finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 18647
• scientific article; zbMATH DE number 3999284
• Very Fast Parallel Polynomial Arithmetic
• Processor-efficient exponentiation in finite fields
• Efficient and optimal exponentiation in finite fields

Cited in

(13)

• A generalisation of Brickell's algorithm for fast modular multiplication
• Encroaching lists as a measure of presortedness
• The iterated mod problem
• Inversion in finite fields using logarithmic depth
• Boolean circuits versus arithmetic circuits
• Parallel identity testing for skew circuits with big powers and applications
• Modular exponentiation via the explicit Chinese remainder theorem
• Equality Testing of Compressed Strings
• scientific article; zbMATH DE number 5627530 (Why is no real title available?)
• scientific article; zbMATH DE number 4062581 (Why is no real title available?)
• The actual complexity of parallel evaluation of low degree polynomials
• Cyclotomic identity testing and applications
• Efficient and optimal exponentiation in finite fields

This page was built for publication: The parallel complexity of exponentiating polynomials over finite fields

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