Polynomial bounds for decoupling, with applications Ryan O’Donnell, Yu Zhao Carnegie Mellon University Block-multilinearity

Source URL: www.computationalcomplexity.org

NTL vs FLINT Victor Shoup April 20,

Source URL: www.shoup.net

• Mathematics
• Algebra
• Arithmetic
• Polynomial
• Fast Fourier transform
• Factorization

NOTES ON COMBINATORIAL APPLICATIONS OF HYPERBOLIC POLYNOMIALS Abstract. These are notes on combinatorial applications of hyperbolic polynomials, one of the topics covered in my course “Topics in Convexity” in Winter

Source URL: www.math.lsa.umich.edu

• Polynomials
• Field extension
• Elementary symmetric polynomial
• Polynomial greatest common divisor
• Factorization

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection Cornelius Brand Saarland University and Cluster of Excellence (MMCI)∗ Michael Sagraloff

Source URL: people.mpi-inf.mpg.de

• Algebra
• Mathematics
• Homogeneous polynomials
• Matrix theory
• Polynomial
• Exponentiation
• Determinant

UMRIDA: Bringing Uncertainty Management and Robust Design Methodologies to Industrial Levels Charles Hirsch, Dirk Wunsch, Thomas Deconinck Numeca International

Source URL: www.aerodays2015.com

• Academia
• Statistics
• Statistical theory
• Operations research
• Actuarial science
• Measurement
• Risk analysis
• Uncertainty quantification
• Polynomial chaos
• Risk management
• Monte Carlo method
• Risk

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ May 8, 2008 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and

Source URL: homepages.cwi.nl

The simplex method is strongly polynomial for deterministic Markov decision processes Ian Post ∗

Source URL: www.ianpost.org

Polynomial Ideals Arithmetic for polynomial ideals supported by Gr¨obner bases Version 1.0 May 1992 Herbert Melenk Konrad-Zuse-Zentrum f¨ ur Informationstechnik

Source URL: www.reduce-algebra.com

WEYL SUMS IN Fq [x] WITH DIGITAL RESTRICTIONS ¨ MANFRED G. MADRITSCH AND JORG M. THUSWALDNER Abstract. Let Fq be a finite field and consider the polynomial ring Fq [X]. Let Q ∈ Fq [X]. A function f : Fq [X] → G, whe

Source URL: institute.unileoben.ac.at

On polynomial systems arising from a Weil descent Based on joint works with JC Faug`ere, JJ Quisquater, L Perret, G Renault Christophe Petit

Source URL: caramba.loria.fr

• Mathematics
• Polynomials
• Algebra
• Equations
• Applied mathematics
• Computer algebra
• Cryptanalysis
• System of polynomial equations
• Data Encryption Standard
• Algebraic equation
• Crypto