Euclid's Algorithm and the Lanczos Method Over Finite Fields

Mathematics of Computation - United States
doi 10.1090/s0025-5718-98-00973-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

The Block Lanczos Algorithm

English

Abelian Varieties Over Finite Fields

Annales Scientifiques de l'Ecole Normale Superieure
Mathematics
1969English

Hypergeometric Functions Over Finite Fields

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1987English

On the Equational Graphs Over Finite Fields

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2020English

The Minimum Rank Problem Over Finite Fields

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2010English

A New Structured Design Method for Convolutions Over Finite Fields, Part I

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1983English

Counting Elliptic Surfaces Over Finite Fields

Moscow Mathematical Journal
Mathematics
2002English

The Matrix-Valued Numerical Range Over Finite Fields

TURKISH JOURNAL OF MATHEMATICS
2019English

Finding Irreducible Polynomials Over Finite Fields

1986English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy