Search results
Jump to navigation
Jump to search
- {{rpl|Artin-Schreier polynomial}} {{rpl|Characteristic polynomial}}5 KB (628 words) - 04:35, 22 November 2023
- ...N'' has type <math>\mu</math>. Hall showed that the functions ''g'' are [[polynomial]] functions of ''p'' with integer coefficients: these are the ''Hall polyno interpreted as the [[Hall-Littlewood polynomial]] functions. The theory of [[Schur function]]s2 KB (264 words) - 22:53, 19 February 2010
- ...xtension field ''E''/''F'' is ''algebraic'' over ''F'' if it satisfies a [[polynomial]] with coefficients in ''F'', and ''transcendental'' over ''F'' if it is no ...ion field is ''separable'' over ''F'' if it is algebraic and its [[minimal polynomial]] over ''F'' has distinct roots. Every algebraic element is separable over3 KB (435 words) - 22:38, 22 February 2009
- ...quely as a combination of only finitely many powers: indeed, this is how a polynomial is defined.3 KB (464 words) - 19:45, 1 December 2008
- ...actability needs a lot of work. Are we defining intractability to mean not polynomial, or to mean not practical? They usually overlap, but many NP-hard problems,475 bytes (72 words) - 18:18, 1 January 2008
- {{r|Polynomial}}449 bytes (56 words) - 18:02, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Artin-Schreier polynomial]]. Needs checking by a human.449 bytes (56 words) - 11:04, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Hermite polynomial]]. Needs checking by a human.512 bytes (63 words) - 17:10, 11 January 2010
- {{r|Artin-Schreier polynomial}}483 bytes (61 words) - 16:42, 11 January 2010
- {{r|Hermite polynomial}}512 bytes (63 words) - 16:57, 11 January 2010
- {{r|Cyclotomic polynomial}}532 bytes (69 words) - 18:44, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Minimal polynomial]]. Needs checking by a human.544 bytes (70 words) - 18:34, 11 January 2010
- ...sum of a constant and a constant multiple of the square of a first-degree polynomial. Thus one has ...riptstyle \Delta </math> stands for the well-known ''discriminant'' of the polynomial, that is <math> \scriptstyle \Delta = b^2 - 4ac </math>.3 KB (517 words) - 08:49, 6 August 2008
- ...can solve some problems in polynomial time that would be non deterministic polynomial time complete ([[NP complete]]) on a conventional computer.2 KB (307 words) - 17:00, 7 March 2024
- {{r|Polynomial ring}}522 bytes (67 words) - 20:03, 11 January 2010
- {{r|Polynomial ring}}541 bytes (67 words) - 19:36, 11 January 2010
- {{r|Minimal polynomial}}550 bytes (71 words) - 15:57, 11 January 2010
- ** The [[polynomial ring]] over a field #'''Hilbert's Basis Theorem''': The [[polynomial ring]] <math>A[X]</math> is Noetherian (hence so is <math>A[X_1,\ldots,X_n]2 KB (326 words) - 09:55, 23 December 2008
- ...eld extension]] ''E''/''F'' which contains all the roots of an irreducible polynomial if it contains one such root.568 bytes (88 words) - 17:21, 7 February 2009
- {{r|Polynomial ring}}626 bytes (79 words) - 16:01, 11 January 2010