Find link

factorization of polynomials not in Elementary function arithmetic

language:

Find link is a tool written by Edward Betts.

Longer titles found: Factorization of polynomials over finite fields (view)

searching for factorization of polynomials 17 found (35 total)

alternate case: Factorization of polynomials

CoCoA (361 words) [view diff] exact match in snippet view article find links to article

zero-dimensional schemes, Poincaré series and Hilbert functions, factorization of polynomials, and toric ideals. The capabilities of CoCoA and the flexibility

Difference of two squares (2,204 words) [view diff] no match in snippet view article find links to article

In elementary algebra, a difference of two squares is one squared number (the number multiplied by itself) subtracted from another squared number. Every

Rational root theorem (1,884 words) [view diff] exact match in snippet view article find links to article

special case (for a single linear factor) of Gauss's lemma on the factorization of polynomials. The integral root theorem is the special case of the rational

Sergei Evdokimov (963 words) [view diff] exact match in snippet view article find links to article

number theory, he found a delicate and simple algorithm for factorization of polynomials over finite fields. The algorithm has a quasi-polynomial complexity

Berlekamp's algorithm (1,759 words) [view diff] exact match in snippet view article find links to article

and the WolframAlpha [1] website. Polynomial factorisation Factorization of polynomials over a finite field and irreducibility tests Cantor–Zassenhaus

Elementary function arithmetic (875 words) [view diff] exact match in snippet view article find links to article

Foundations of Mathematics vol. 117. S. G. Simpson, R. L. Smith, "Factorization of polynomials and Σ 1 0 {\displaystyle \Sigma _{1}^{0}} -induction" (1986)

Lloyd Dines (707 words) [view diff] exact match in snippet view article find links to article

MR 1560882. Dines, Lloyd L. (1924). "A theorem on the factorization of polynomials of a certain type". Trans. Amer. Math. Soc. 26: 17–24. doi:10

Bombieri norm (840 words) [view diff] exact match in snippet view article find links to article

ISBN 0-521-84615-3. MR 2216774. Knuth, Donald E. (1997). "4.6.2 Factorization of polynomials". Seminumerical algorithms. The Art of Computer Programming.

Venkatesan Guruswami (527 words) [view diff] exact match in snippet view article find links to article

a list-decoding algorithm) and is based on interpolation and factorization of polynomials over G F ( 2 m ) {\displaystyle GF(2^{m})} and its extensions

Conservative extension (888 words) [view diff] exact match in snippet view article find links to article

new constant and function names S. G. Simpson, R. L. Smith, "Factorization of polynomials and Σ 1 0 {\displaystyle \Sigma _{1}^{0}} -induction" (1986)

Schinzel's hypothesis H (1,743 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-8218-4406-9. Zbl 1187.11046. Swan, R. G. (1962). "Factorization of Polynomials over Finite Fields". Pacific Journal of Mathematics. 12 (3):

Exercise (mathematics) (2,313 words) [view diff] exact match in snippet view article

two digits. A common exercise in elementary algebra calls for factorization of polynomials. Another exercise is completing the square in a quadratic polynomial

Computer algebra (3,021 words) [view diff] case mismatch in snippet view article find links to article

Collins, George Edwin; Loos, Rüdiger; Albrecht, Rudolf (eds.), "Factorization of Polynomials", Computer Algebra, Computing Supplementa, vol. 4, Vienna: Springer

Square-free integer (3,689 words) [view diff] exact match in snippet view article find links to article

polynomials, as polynomial-time algorithms are known for square-free factorization of polynomials (in short, the largest square-free factor of a polynomial is

Mahler measure (2,296 words) [view diff] case mismatch in snippet view article find links to article

1007/BF02417878. JFM 30.0364.02. Knuth, Donald E. (1997). "4.6.2 Factorization of Polynomials". Seminumerical Algorithms. The Art of Computer Programming.

Per Enflo (4,334 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-8176-3772-9. MR 1392949. Knuth, Donald E (1997). "4.6.2 Factorization of Polynomials". Seminumerical Algorithms. The Art of Computer Programming.

Reed–Solomon error correction (12,405 words) [view diff] exact match in snippet view article find links to article

a list-decoding algorithm) and is based on interpolation and factorization of polynomials over GF(2m) and its extensions. In 2023, building on three exciting[according