• 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
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems Timothy M. Chan
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems Timothy M. Chan

... and n axis-aligned rectangles, compute the number size and optimal O(lg n/ lg lg√n) query time, which can of points inside each rectangle. The problem has be constructed faster in O(n lg n) time. The generalization of the result in dimenan immediate application to 2-d orthogonal segment intersection ...
Document
Document

Multiplicative Inverse
Multiplicative Inverse

PDF - WordPress.com
PDF - WordPress.com

THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Qp
THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Qp

Cyclic groups and elementary number theory
Cyclic groups and elementary number theory

MAT 364 - Homework 9 Solutions
MAT 364 - Homework 9 Solutions

OPERADS, FACTORIZATION ALGEBRAS, AND (TOPOLOGICAL
OPERADS, FACTORIZATION ALGEBRAS, AND (TOPOLOGICAL

Sequences, Sums, Cardinality
Sequences, Sums, Cardinality

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 19
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 19

International Electrical Engineering Journal (IEEJ)
International Electrical Engineering Journal (IEEJ)

Multiplying Two Binomials
Multiplying Two Binomials

1 Localization
1 Localization

Factor Out the Greatest Common Factor Factor by Grouping
Factor Out the Greatest Common Factor Factor by Grouping

Handout
Handout

Isometries of the plane - math.jacobs
Isometries of the plane - math.jacobs

ON THE GENERA OF X0(N) 1. Introduction For each positive integer
ON THE GENERA OF X0(N) 1. Introduction For each positive integer

M328K Final Exam Solutions, May 10, 2003 1. “Bibonacci” numbers
M328K Final Exam Solutions, May 10, 2003 1. “Bibonacci” numbers

Factoring Whole Numbers
Factoring Whole Numbers

Chapter 5 Common Functions and their Properties
Chapter 5 Common Functions and their Properties

... Since two values of x result from a given value of y, the inverse function is multivalued. This tells us that a function may be single-valued but its inverse may be multivalued or vice-versa. In many applications, only the positive square root would be of interest, so if the negative square root is ...
ODD PERFECT NUMBERS HAVE A PRIME FACTOR EXCEEDING
ODD PERFECT NUMBERS HAVE A PRIME FACTOR EXCEEDING

Geometry of Cubic Polynomials - Exhibit
Geometry of Cubic Polynomials - Exhibit

2.4 Points on modular curves parameterize elliptic curves with extra
2.4 Points on modular curves parameterize elliptic curves with extra

... 1/N ∈ Λτ . Third, let Qτ be the point of order N in Eτ defined by τ /N , and consider the basis (Pτ , Qτ ) for E[N ]. Let E be an elliptic curve over C. Theorem 2.4.5 below asserts that the non-cuspidal points on X0 (N ) correspond to isomorphism classes of pairs (E, C) where C is a cyclic subgroup ...
In this lecture we will start with Number Theory. We will start
In this lecture we will start with Number Theory. We will start

Note on Nakayama`s Lemma For Compact Λ
Note on Nakayama`s Lemma For Compact Λ

... X/IX is finite then X is actually a torsion Λ module. This is immediate from the structure theorem for Λ modules that we have in this case. This result does not, however, extend to other pro-p groups in general. We first note that the concept of a torsion module is only useful when Λ has no zero div ...
< 1 ... 64 65 66 67 68 69 70 71 72 ... 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