Result 1 to 20 of 145 total
Planarity of products of two linearized polynomials. (English)
Finite Fields Appl. 18, No. 6, 1076-1088 (2012).
1
Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields. (English)
Appl. Math. Sci., Ruse 6, No. 37-40, 1997-2003 (2012).
2
Method of generating irreducible polynomials over $GF(3)$ on the basis of trinomials. (English)
Moreno-Díaz, Roberto (ed.) et al., Computer aided systems theory ‒ EUROCAST 2011. 13th international conference, Las Palmas de Gran Canaria, Spain, February 6‒11, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-27578-4/pbk). Lecture Notes in Computer Science 6928, 335-342 (2012).
3
The distance to an irreducible polynomial, II. (English)
Math. Comput. 81, No. 279, 1571-1585 (2012).
4
A correspondence of certain irreducible polynomials over finite fields. (English)
Finite Fields Appl. 18, No. 2, 384-395 (2012).
5
An alternative class of irreducible polynomials for optimal extension fields. (English)
Des. Codes Cryptography 60, No. 2, 171-182 (2011).
6
The equational complexity of Lyndon’s algebra. (English)
Algebra Univers. 65, No. 3, 243-262 (2011).
7
Regeneration homotopies for solving systems of polynomials. (English)
Math. Comput. 80, No. 273, 345-377 (2011).
8
Some remarks on testing irreducibility of polynomials and normality of bases in finite fields. (English)
Fundam. Inform. 104, No. 3, 227-238 (2010).
9
The distance to an irreducible polynomial. (English)
Amdeberhan, Tewodros (ed.) et al., Gems in experimental mathematics. AMS special session on experimental mathematics, Washington, DC, January 5, 2009. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4869-2/pbk). Contemporary Mathematics 517, 275-288 (2010).
10
On computing absolutely irreducible components of algebraic varieties with parameters. (English)
Computing 89, No. 1-2, 45-68 (2010).
11
A lecture on the complexity of factoring polynomials over global fields. (English)
Int. Math. Forum 5, No. 9-12, 477-486 (2010).
12
A survey on the complexity of solving algebraic systems. (English)
Int. Math. Forum 5, No. 5-8, 333-353 (2010).
13
A numerical local dimension test for points on the solution set of a system of polynomial equations. (English)
SIAM J. Numer. Anal. 47, No. 5, 3608-3623 (2009).
14
Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials. (English)
Robbiano, Lorenzo (ed.) et al., Approximate commutative agebra. Berlin: Springer (ISBN 978-3-211-99313-2/pbk; 978-3-211-99314-9/e-book). Texts and Monographs in Symbolic Computation, 55-77 (2009).
15
Spectrally arbitrary complex sign pattern matrices. (English)
Electron. J. Linear Algebra 18, 674-692, electronic only (2009).
16
Some number-theoretic combinatorial problems. (English)
Math. Notes 86, No. 3, 368-372 (2009); translation from Mat. Zametki 86, No. 3, 402-407 (2009).
17
Towards toric absolute factorization. (English)
J. Symb. Comput. 44, No. 9, 1194-1211 (2009).
18
Characteristic set method for differential-difference polynomial systems. (English)
J. Symb. Comput. 44, No. 9, 1137-1163 (2009).
19
On the existence of graphs of diameter two and defect two. (English)
Discrete Math. 309, No. 10, 3166-3172 (2009).
20
Result 1 to 20 of 145 total
Start
Contact
Print
General Help
