DOI: 10.32657/10356/54869
|View full text |Cite
|
Sign up to set email alerts
|

Efficient polynomial evaluation algorithm and implementation on FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 42 publications
0
1
0
Order By: Relevance
“…[13], which has run time of O(log 2 m), hence is very suitable for polynomial whose degree is a power of 2. The later was also discussed by Xu [17] and Reynolds [15].…”
Section: Literature Reviewmentioning
confidence: 87%
“…[13], which has run time of O(log 2 m), hence is very suitable for polynomial whose degree is a power of 2. The later was also discussed by Xu [17] and Reynolds [15].…”
Section: Literature Reviewmentioning
confidence: 87%