Provably Faithful Evaluation of Polynomials

doi 10.1145/1141277.1141586
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Provably Secure Public Key Cryptosystem Based on Chebyshev Polynomials

Journal of Communications
Electronic EngineeringElectrical
2015English

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Evaluation Properties of Symmetric Polynomials

International Journal of Algebra and Computation
Mathematics
2006English

Asymptotic Evaluation of Gauss Polynomials

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Fast Multipoint Evaluation of Bivariate Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Provably Correct Compiler Generation

DAIMI Report Series
1992English

Provably Secure Cryptographic Constructions

2012English

Faithful Abelian Groups of Infinite Rank

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Groups With Faithful Blocks

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy