APPROXIMATE COMPUTATION OF ZERO-DIMENSIONAL POLYNOMIAL IDEALS DANIEL HELDT, MARTIN KREUZER, SEBASTIAN POKUTTA, AND HENNIE POULISSE Abstract. The Buchberger-M¨ oller algorithm is a well-known efficient tool for computing

Source URL: www.uni-passau.de

The MAPLE Package “Janet”: I. Polynomial Systems Yuri A. Blinkov1? , Carlos F. Cid2?? , Vladimir P. Gerdt3? ? ? , Wilhelm Plesken2† , and Daniel Robertz2‡ 1

Source URL: wwwb.math.rwth-aachen.de

1. The Method of Dominant Balance The method of dominant balance can be used to determine the order of magnitude of terms in an equation. Let us examine a low order polynomial first to acquant ourselves with the method.

Source URL: leto.net

• Asymptotic analysis
• Numerical linear algebra
• Mathematics
• Maths24
• KnuthBendix completion algorithm

JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Optimum Statistical Estimation with Strategic Data Sources Yang Cai∗ CAI @ CS . MCGILL . CA

Source URL: jmlr.org

• Statistics
• Estimation theory
• Econometrics
• Regression analysis
• Statistical theory
• Least squares
• Linear regression
• Polynomial regression
• Loss function
• Kernel regression
• Efficiency
• Mean squared error

Thread boosting and polynomial factorization in NTL Victor Shoup October 21, 2015 As of version 9.5.0, NTL provides a thread boosting feature. With this feature, certain code within NTL will use available threads to spee

Source URL: www.shoup.net

• Parallel computing
• Algebra
• Polynomials
• Computer algebra
• Arithmetic
• Factorization of polynomials
• Multi-core processor
• Factorization
• Speedup

Solving efficiently structured polynomial systems and Applications in Cryptology Jean-Charles Faugère Joint work with: L. Huot

Source URL: ecc2011.loria.fr

• Computer algebra
• Algebraic geometry
• Polynomials
• Algebra
• Commutative algebra
• Grbner basis
• Monomial order
• System of polynomial equations
• Resultant
• Monomial
• Lexicographical order
• Jean-Charles Faugre

.5cm. Computing real radical ideals and real roots of polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski

Source URL: homepages.cwi.nl

Computing an Extensive-Form Correlated Equilibrium in Polynomial Time Wan Huang and Bernhard von Stengel Department of Mathematics, London School of Economics, London WC2A 2AE, United Kingdom , stengel

Source URL: www.maths.lse.ac.uk

• Mathematics
• Convex optimization
• Operations research
• Academia
• Applied mathematics
• Game theory
• Extensive-form game
• Nash equilibrium
• Normal-form game
• Ellipsoid method
• Linear programming
• Polynomial

NCPOLY: Computation in non–commutative polynomial ideals Herbert Melenk Konrad–Zuse–Zentrum f¨ ur Informationstechnik Berlin Takustrasse 7

Source URL: www.reduce-algebra.com

Introduction The MQ Problem Polynomial Equivalence Problems

Source URL: caramba.loria.fr

• Cryptography
• Multivariate cryptography
• Hidden Field Equations
• Polynomial
• IP
• Quadratic