Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field

Giménez, Nardo; Matera, Guillermo; Pérez, Mariana; Privitelli, Melina

doi:10.48550/arxiv.2001.03222

2020

DOI: 10.48550/arxiv.2001.03222

|View full text |Cite

Preprint

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field

Nardo Giménez¹,

Guillermo Matera²,

Mariana Pérez³

et al.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field

This publication either has no citations yet, or we are still processing them

See others like this or search for similar articles

Contact Info

Product

Resources

About