The computational efficacy of finite-field arithmetic

DOI10.1016/0304-3975(93)90022-LzbMath0774.68066OpenAlexW2032013893MaRDI QIDQ1210295

Carl Sturtivant, Gudmund Skovbjerg Frandsen

Publication date: 24 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90022-l

zbMATH Keywords

finite fieldBoolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Related Items (4)

Some results on uniform arithmetic circuit complexity ⋮ The weak lambda calculus as a reasonable machine ⋮ An arithmetic model of computation equivalent to threshold circuits ⋮ Polynomial expressions of \(p\)-ary auction functions

Cites Work

• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• An arithmetic model of computation equivalent to threshold circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The computational efficacy of finite-field arithmetic