1![Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain](https://www.pdfsearch.io/img/8118bfceece96240449a5148e7bffd54.jpg) | Add to Reading ListSource URL: www.lsi.upc.eduLanguage: English - Date: 2014-05-28 10:18:30
|
---|
2![PARALLEL KRYLOV SOLVERS FOR THE POLYNOMIAL EIGENVALUE PROBLEM IN SLEPc∗ CARMEN CAMPOS† AND JOSE E. ROMAN† Abstract. Polynomial eigenvalue problems are often found in scientific computing applications. When the coef PARALLEL KRYLOV SOLVERS FOR THE POLYNOMIAL EIGENVALUE PROBLEM IN SLEPc∗ CARMEN CAMPOS† AND JOSE E. ROMAN† Abstract. Polynomial eigenvalue problems are often found in scientific computing applications. When the coef](https://www.pdfsearch.io/img/0d2a58915c03bc441e789e239fdbf698.jpg) | Add to Reading ListSource URL: users.dsic.upv.esLanguage: English - Date: 2015-05-20 08:54:40
|
---|
3![Affine Transformations of Algebraic Numbers D.J. Jeffrey ∗ Pratibha Affine Transformations of Algebraic Numbers D.J. Jeffrey ∗ Pratibha](https://www.pdfsearch.io/img/e89639a42064cc581e0690005042a608.jpg) | Add to Reading ListSource URL: www.apmaths.uwo.caLanguage: English - Date: 2005-05-05 16:03:06
|
---|
4![Symmetric Cryptography and Algebraic Curves Jos´ e Felipe Voloch Abstract: We discuss some applications of the theory of algebraic curves to the study of S-boxes in symmetric cryptography. 0. Introduction Symmetric Cryptography and Algebraic Curves Jos´ e Felipe Voloch Abstract: We discuss some applications of the theory of algebraic curves to the study of S-boxes in symmetric cryptography. 0. Introduction](https://www.pdfsearch.io/img/de56066b21bec5cf22e8ca3bdd7cf896.jpg) | Add to Reading ListSource URL: www.ma.utexas.eduLanguage: English - Date: 2006-10-25 10:27:37
|
---|
5![MATHEMATICS 129, SPRING 2009 NUMBER FIELDS KATHERINE E. STANGE Contents 1. MATHEMATICS 129, SPRING 2009 NUMBER FIELDS KATHERINE E. STANGE Contents 1.](https://www.pdfsearch.io/img/34c83fa6cc20bed5096200012c98a813.jpg) | Add to Reading ListSource URL: math.colorado.eduLanguage: English - Date: 2015-10-18 16:52:55
|
---|
6![Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes, Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes,](https://www.pdfsearch.io/img/f70f347e1cca3fdf4379953f4a3d728e.jpg) | Add to Reading ListSource URL: www.ma.utexas.eduLanguage: English - Date: 2004-10-22 18:26:34
|
---|
7![ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa](https://www.pdfsearch.io/img/c72e1e5b552002a7fdaac004c8b6ec40.jpg) | Add to Reading ListSource URL: math.mit.eduLanguage: English - Date: 2012-10-10 15:15:19
|
---|
8![Computer discovery and analysis of large Poisson polynomials David H. Bailey∗ Jonathan M. Borwein† Jason S. Kimberley‡ Computer discovery and analysis of large Poisson polynomials David H. Bailey∗ Jonathan M. Borwein† Jason S. Kimberley‡](https://www.pdfsearch.io/img/6916e5abde3af00b68a0dea97c52c8e3.jpg) | Add to Reading ListSource URL: www.davidhbailey.comLanguage: English - Date: 2016-05-10 23:34:31
|
---|
9![J. Symbolic Computation, 351–369 Lattices of Compatibly Embedded Finite Fields† WIEB BOSMA‡, JOHN CANNON§ AND ALLAN STEEL¶ Computational Algebra Group, School of Mathematics and Statistics, The Univers J. Symbolic Computation, 351–369 Lattices of Compatibly Embedded Finite Fields† WIEB BOSMA‡, JOHN CANNON§ AND ALLAN STEEL¶ Computational Algebra Group, School of Mathematics and Statistics, The Univers](https://www.pdfsearch.io/img/4dc53d86051612f38cd49fa13ec401bf.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2008-01-31 05:32:49
|
---|
10![Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands, Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,](https://www.pdfsearch.io/img/5b95f5d141a12e090733cdd08d720c0d.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2003-03-04 03:36:09
|
---|