CS369N: Beyond Worst-Case Analysis Lecture #7: Smoothed Analysis∗ Tim Roughgarden† November 30,

Source URL: theory.stanford.edu

• Operations research
• Computational complexity theory
• Linear programming
• Mathematical optimization
• Artificial neural networks
• Perceptron
• Simplex algorithm
• Smoothed analysis
• Algorithm
• Simplex
• Time complexity
• Polynomial

Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob

Source URL: thmatters.files.wordpress.com

• Quantum information science
• Quantum computing
• Quantum cryptography
• Quantum mechanics
• Emerging technologies
• Quantum algorithm
• Quantum information
• Quantum gravity
• Quantum complexity theory
• Theoretical computer science
• Boson sampling
• Quantum key distribution

RANDPOLY: A Random Polynomial Generator Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

Source URL: reduce-algebra.com

• Algebra
• Polynomials
• Homogeneous polynomials
• Elementary algebra
• Monomial
• Polynomial
• Algebraic expression
• Variable
• Anonymous function
• Maple
• Polynomial ring
• Monomial order

Interval Methods for Kinetic Simulations Leonidas J. Guibas∗ Menelaos I. Karavelas∗ Graphics Lab., Computer Science Dept., Stanford University

Source URL: cs.smith.edu

• Polynomials
• Polynomial
• Root-finding algorithm
• Kinetic data structure
• Zero of a function
• Polynomial interpolation
• Polynomial greatest common divisor

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK

Source URL: community.dur.ac.uk

• NP-complete problems
• Graph coloring
• Bipartite graph
• Parity
• Comparability graph
• Matching
• Trapezoid graph
• Interval graph
• Graph
• Independent set
• Interval edge coloring
• Planar graph

LOCALLY TAME PLANE POLYNOMIAL AUTOMORPHISMS JOOST BERSON, ADRIEN DUBOULOZ, JEAN-PHILIPPE FURTER, AND STEFAN MAUBACH Abstract. For automorphisms of a polynomial ring in two variables over a domain R, we show that local ta

Source URL: perso.univ-lr.fr

• Commutative algebra
• Ring theory
• Algebraic structures
• Ring
• Morphism of algebraic varieties
• Polynomial ring
• Commutative ring
• Dedekind domain
• Integral element
• Divisor
• Automorphism

How Euler Did It by Ed Sandifer A theorem of Newton April 2008 Early in our algebra careers we learn the basic relationship between the coefficients of a monic quadratic polynomial and the roots of that polynomial. If th

Source URL: eulerarchive.maa.org

• Polynomials
• Elementary algebra
• Algebra
• Parabolas
• Quadratic function
• Exponentiation
• Basel problem
• Factorization
• CauchyEuler equation

Approximate Polynomial Decomposition∗ Robert M. Corless†‡ Mark W. Giesbrecht‡

Source URL: www.apmaths.uwo.ca

• Operator theory
• Complex analysis
• Digital signal processing
• Field theory
• Fundamental theorem of algebra
• Random permutation statistics

Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that was

Source URL: www-tcs.cs.uni-sb.de

• Multiplication
• Binary operations
• Algebra
• Computational complexity theory
• Time complexity
• Polynomial
• Multiplication algorithm
• Karatsuba algorithm

A Design-Adaptive Local Polynomial Estimator for the Errors-in-Variables Problem ∗ Aurore Delaigle, Jianqing Fan, and Raymond J. Carroll Abstract: Local polynomial estimators are popular techniques for nonparametric re

Source URL: www.ms.unimelb.edu.au