• 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
Publikationen - Mathematisches Institut
Publikationen - Mathematisches Institut

The structure of the classifying ring of formal groups with
The structure of the classifying ring of formal groups with

Connections between relation algebras and cylindric algebras
Connections between relation algebras and cylindric algebras

MA2202 Algebra I. - Dept of Maths, NUS
MA2202 Algebra I. - Dept of Maths, NUS

Clock Arithmetic and Euclid`s Algorithm
Clock Arithmetic and Euclid`s Algorithm

Coping with Friction for Non-penetrating Rigid Body Simulation
Coping with Friction for Non-penetrating Rigid Body Simulation

Group Cohomology
Group Cohomology

Abstract Algebra - UCLA Department of Mathematics
Abstract Algebra - UCLA Department of Mathematics

Assigning agents to a line
Assigning agents to a line

Flat primes and thin primes
Flat primes and thin primes

Chapter 4.6 - CS Course Webpages
Chapter 4.6 - CS Course Webpages

The Fundamentals: Algorithms, the Integers, and Matrices
The Fundamentals: Algorithms, the Integers, and Matrices

Admissible Infinitary Rules in Modal Logic. Part II
Admissible Infinitary Rules in Modal Logic. Part II

The bounded derived category of an algebra with radical squared zero
The bounded derived category of an algebra with radical squared zero

PDF
PDF

... 3 Theorem (Moses). Let R be a computable relation on the domain of a computable linear ordering L. Then R is either definable by a quantifier-free formula with constants from L (in which case it is intrinsically computable) or not intrinsically computable. Another approach to the study of relations ...
From tilings by Pythagorean triangles to Dyck paths: a
From tilings by Pythagorean triangles to Dyck paths: a

ams.org - Semantic Scholar
ams.org - Semantic Scholar

Document
Document

BOOK OF ABSTRACTS  11 International Workshop on Finite Elements
BOOK OF ABSTRACTS 11 International Workshop on Finite Elements

... including metallic plates etc., plus some cowboy singers and entertainers. The Elkhorn Lodge is the oldest continually occupied structure in Colorado. ...
Document
Document

Topological Models for Arithmetic William G. Dwyer and Eric M
Topological Models for Arithmetic William G. Dwyer and Eric M

HOMEWORK SOLUTIONS Homework 1: 1. show if a|b and c|d then
HOMEWORK SOLUTIONS Homework 1: 1. show if a|b and c|d then

ETALE COHOMOLOGY AND THE WEIL CONJECTURES Sommaire 1.
ETALE COHOMOLOGY AND THE WEIL CONJECTURES Sommaire 1.

Numbers, Groups and Cryptography Gordan Savin
Numbers, Groups and Cryptography Gordan Savin

rsa
rsa

< 1 ... 4 5 6 7 8 9 10 11 12 ... 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