Find link

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 19 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 (1,926 words) [view diff] no match in snippet view article find links to article

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

Rational root theorem (1,618 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,672 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 (872 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)

Bombieri norm (809 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.

Conservative extension (861 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,687 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):

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

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

Venkatesan Guruswami (515 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

Computer algebra (3,014 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, vol. 4, Vienna: Springer Vienna, pp. 95–113

Square-free integer (3,567 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,143 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.

The Art of Computer Programming (3,501 words) [view diff] case mismatch in snippet view article find links to article

Polynomial Arithmetic 4.6.1. Division of Polynomials 4.6.2. Factorization of Polynomials 4.6.3. Evaluation of Powers (addition-chain exponentiation) 4

Per Enflo (4,332 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.

Emmy Noether (13,092 words) [view diff] exact match in snippet view article find links to article

Kurt Hentzelt. She showed that fundamental theorems about the factorization of polynomials could be carried over directly. Traditionally, elimination theory

Reed–Solomon error correction (12,002 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