On the Evaluation of Powers and Monomials
From MaRDI portal
Publication:3893298
DOI10.1137/0209022zbMath0447.68035OpenAlexW2136975477MaRDI QIDQ3893298
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/141
Related Items
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments, Separating OR, SUM, and XOR circuits, Symbolic treatment of geometric degeneracies, Mechanically proving termination using polynomial interpretations, Computing special powers in finite fields, Rectifier Circuits of Bounded Depth, Gemini: elastic SNARKs for diverse environments, On the computation complexity of the systems of finite abelian group elements, How to recover a secret with \(O(n)\) additions, Parallel algorithms for modular multi-exponentiation, On the complexity of matrix reduction over finite fields, Delegating a product of group exponentiations with application to signature schemes, A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices, On Bellman's and Knuth's problems and their generalizations, The minimum number of edges in graphs with prescribed paths, Relation between two measures of the computation complexity for systems of monomials, Accelerating Oblivious Transfer with Batch Multi-exponentiation, A simple proof for the upper bound of the computational complexity of three monomials in three variables, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems, Cancellation-free circuits in unbounded and bounded depth
