J Glob Optim:327–345 DOIs10898A scaling algorithm for polynomial constraint satisfaction problems Ferenc Domes · Arnold Neumaier

Source URL: solon.cma.univie.ac.at

Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations∗ Gottfried Herold1 , Julia Hesse2 , Dennis Hofheinz2 , Carla R`afols1 , and Andy Rupp2 1 Ruhr-University Bochum, Germany

Source URL: www.kjdf.de

RELATIVE POLYNOMIAL CLOSURE AND MONADICALLY KRULL MONOIDS OF INTEGER-VALUED POLYNOMIALS SOPHIE FRISCH Abstract. Let D be a Krull domain and Int(D) the ring of integer-valued polynomials on D. For any f ∈ Int(D), we exp

Source URL: blah.math.tu-graz.ac.at

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

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

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

DRAFT Declarative Equations, Compositional Strategies: Solving Differential Systems with Lazy Splines Functional Pearl Gershom Bazerman

Source URL: gbaz.github.io

• Interpolation
• Spline
• Polynomial
• Flat spline
• Differential equation
• Ordinary differential equation
• Cubic Hermite spline
• B-spline

The Approach of Moments for Polynomial Equations Monique Laurent1 and Philipp Rostalski2 1 2

Source URL: homepages.cwi.nl

JAR manuscript No. (will be inserted by the editor) Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq Érik Martin-Dorel · Guillaume Melquiond

Source URL: www.lri.fr

• Computer algebra
• Computer arithmetic
• Algebra
• Numerical analysis
• Polynomials
• Interval arithmetic
• Automatic differentiation
• Floating point
• Polynomial
• Remainder
• Symbolic computation
• Interval

COMPACT: Reduction of a Polynomial in the Presence of Side Relations Anthony C. Hearn RAND Santa Monica CAEmail:

Source URL: www.reduce-algebra.com

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

Source URL: homepages.cwi.nl

Polynomial forms for Calogero-type Hamiltonians Vladimir V. Sokolov Landau Institute for Theoretical Physics, Joint with A. Turbiner

Source URL: matphys.itp.ac.ru