Lines Matching full:degree

56  * (BTA) down to a certain degree (4), after which ad hoc low-degree polynomial
64  * [2] [Zin96] V.A. Zinoviev. On the solution of equations of degree 10 over
105 	unsigned int deg;    /* polynomial degree */
109 /* given its degree, compute a polynomial size in bytes */
112 /* polynomial of degree 1 */
310 	/* polynomial degree is the most-significant bit index */  in deg()
535  * this function builds and solves a linear system for finding roots of a degree
573  * compute root r of a degree 1 polynomial over GF(2^m) (returned as log(1/r))
588  * compute roots of a degree 2 polynomial over GF(2^m)
630  * compute roots of a degree 3 polynomial over GF(2^m)
663  * compute roots of a degree 4 polynomial over GF(2^m)
904 		/* handle low degree polynomials with ad hoc techniques */  in find_poly_roots()
1081 	/* primitive polynomial must be of degree m */  in build_gf_tables()
1136  * build a base for factoring degree 2 polynomials
1268  * You may provide your own primitive polynomial of degree @m in argument