Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α ∈ K. The minimal polynomial Let K be a number field and let α ∈

Source URL: www.jchl.co.uk

Michael Batanin Macquarie University Homotopy theory of algebras of polynomial monads We study the existence and left properness of transferred model structures for “monoid-like” objects in monoidal model categories.

Source URL: web.science.mq.edu.au

Continuous optimization polynomial-time upper bounds on the stability number of graphs Domingos M. Cardoso and Sofia Pinheiro University of Aveiro Iberian Conference in Optimization

Source URL: www.cim.pt

BRICS Basic Research in Computer Science BRICS RSMiltersen et al.: Half-Exponential Circuit Size in the Exponential Hierarchy Super-Polynomial Versus Half-Exponential

Source URL: www.brics.dk

Global Stereo in Polynomial Time Carlo Tomasi Duke University 1

Source URL: www.cs.duke.edu

Testing fit patterns with polynomial regression models Felix Schönbrodt Ludwig-Maximilians-Universität München, Germany RA FT

Source URL: www.psy.lmu.de

• Akaike information criterion
• Polynomial regression
• Coefficient of determination
• Degrees of freedom
• Curve fitting
• Cross-validation
• Model selection
• Nonparametric regression
• Statistics
• Regression analysis
• Linear regression

On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)

Source URL: www.cs.swan.ac.uk

• Complexity classes
• Proof theory
• Structural complexity theory
• Curry–Howard correspondence
• Type theory
• NP
• Time complexity
• Reduction
• Linear logic
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

LOCATING AND COMPUTING THE EIGENVALUES OF MATRIX POLYNOMIALS USING TROPICAL ALGEBRA Meisam Sharify (Department of Computer Science, Shahid Beheshti University, Tehran, Iran.) The known results of Hadamard, Ostrowski and

Source URL: math.ipm.ac.ir

• Matrix theory
• Polynomials
• Matrices
• Numerical linear algebra
• Eigenvalue algorithm
• Eigenvalues and eigenvectors
• Matrix
• Eigendecomposition of a matrix
• Characteristic polynomial
• Algebra
• Linear algebra
• Mathematics

How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014

Source URL: arxiv.org

• Polynomials
• Matroid theory
• Tutte polynomial
• Time complexity
• IP
• XTR
• PP
• P/poly
• Bounded-error probabilistic polynomial
• Theoretical computer science
• Mathematics
• Computational complexity theory

Math: Algebra II Graphing Polynomials of Higher Degree Objectives Students will be able to: • Relate the real roots of a polynomial to the x-intercepts of its graph. • Graph simple polynomials of degree three a

Source URL: www.wolframalpha.com

• Degree of a polynomial
• Zero of a function
• Quadratic polynomial
• Geometry of roots of real polynomials
• Mathematics
• Polynomials
• Algebra