• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
2. Model for Composition Analysis - The University of Texas at Dallas
2. Model for Composition Analysis - The University of Texas at Dallas

An Introduction to Algebra and Geometry via Matrix Groups
An Introduction to Algebra and Geometry via Matrix Groups

4.5 Properties of Logarithms
4.5 Properties of Logarithms

sparse matrices in matlab: design and implementation
sparse matrices in matlab: design and implementation

A Few New Facts about the EKG Sequence
A Few New Facts about the EKG Sequence

Matrix Groups
Matrix Groups

A note on feasibility in Benders Decomposition
A note on feasibility in Benders Decomposition

Symmetric and Asymmetric Primes
Symmetric and Asymmetric Primes

Contents - Harvard Mathematics Department
Contents - Harvard Mathematics Department

distinguished subfields - American Mathematical Society
distinguished subfields - American Mathematical Society

Group cohomology - of Alexey Beshenov
Group cohomology - of Alexey Beshenov

The 3-Part of Class Numbers of Quadratic Fields
The 3-Part of Class Numbers of Quadratic Fields

Commutative Algebra Notes Introduction to Commutative Algebra
Commutative Algebra Notes Introduction to Commutative Algebra

The Spectrum of a Ring as a Partially Ordered Set.
The Spectrum of a Ring as a Partially Ordered Set.

... prime ideals which are contractions of the maximal ideals of the By [11, page 2153, ^ roust be contained in one of them. we may say that M is the contraction of Since (J(R^) f| R) f°r i=l, ...
13. Dedekind Domains
13. Dedekind Domains

LINEAR INDEPENDENCE OF LOGARITHMS OF - IMJ-PRG
LINEAR INDEPENDENCE OF LOGARITHMS OF - IMJ-PRG

The Logarithmic Constant: log 2
The Logarithmic Constant: log 2

Chapter IV. Quotients by group schemes. When we work with group
Chapter IV. Quotients by group schemes. When we work with group

Number Theory Notes
Number Theory Notes

Our Number Theory Textbook
Our Number Theory Textbook

Exponential equations and logarithms
Exponential equations and logarithms

Hopfian $\ell $-groups, MV-algebras and AF C $^* $
Hopfian $\ell $-groups, MV-algebras and AF C $^* $

LinearTimeSorting - Centro de Informática da UFPE
LinearTimeSorting - Centro de Informática da UFPE

ppt - Dave Reed
ppt - Dave Reed

The arithmetic mean of the divisors of an integer
The arithmetic mean of the divisors of an integer

... (s,m) = 1, s is square-full, and m is square-free, then it is easy to see that there is a positive integer K such that the set of n whose square-full part s exceeds K has asymptotic density < e . (Indeed, this follows at once from the fact that the sum of the reciprocals of the square-full numbers i ...
< 1 ... 7 8 9 10 11 12 13 14 15 ... 231 >

Factorization of polynomials over finite fields

In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.The case of the factorization of univariate polynomials over a finite field, which is the subject of this article, is especially important, because all the algorithms (including the case of multivariate polynomials over the rational numbers), which are sufficiently efficient to be implemented, reduce the problem to this case (see Polynomial factorization). It is also interesting for various applications of finite fields, such as coding theory (cyclic redundancy codes and BCH codes), cryptography (public key cryptography by the means of elliptic curves), and computational number theory.As the reduction of the factorization of multivariate polynomials to that of univariate polynomials does not have any specificity in the case of coefficients in a finite field, only polynomials with one variable are considered in this article.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report