SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

Equivalence of Linear, Free, Liberal, Structured Program Schemas is Decidable in Polynomial Time (Technical Report). Michael R.Laurence d Sebastian Danicic a Mark Harman d Rob Hierons b John Howroyd c a

Source URL: sebastian.doc.gold.ac.uk

A polynomial-time algorithm to design push plans for sensorless parts sorting Mark de Berg∗ , Xavier Goaoc∗ and A. Frank van der Stappen† ∗ Department of Mathematics and Computer Science

Source URL: www.roboticsproceedings.org

Entropy of automorphisms, homology and the intrinsic polynomial structure of nilpotent groups Thomas Koberda Abstract. We study the word length entropy of automorphisms of residually nilpotent groups, and how the entropy

Source URL: users.math.yale.edu

PDF Document

Source URL: homepages.ecs.vuw.ac.nz

• Graph theory
• Graph coloring
• Polynomials
• Matroid theory
• Tutte polynomial
• Chromatic polynomial
• Petersen graph
• Matroid
• Ear decomposition
• Spanning tree
• Line graph
• Graph

PDF Document

Source URL: highlights-conference.org

• Mathematics
• Geometry
• Polynomials
• Operator theory
• Representation theory
• Metric geometry
• Logic programming
• Substitution
• Tutte polynomial

PDF Document

Source URL: hcp.sap.com

• Statistics
• Regression analysis
• Estimation theory
• Software
• Business
• Business intelligence
• Insurance
• Predictive analytics
• Exponential smoothing
• SAP SE
• Autoregressive integrated moving average
• Polynomial regression

Visualising the Tutte Polynomial Computation Bennett Thompson and David J. Pearce Gary Haggard Computer Science Group

Source URL: homepages.ecs.vuw.ac.nz

J. R. Statist. Soc. B, Part 1, pp. 49–69 Local composite quantile regression smoothing: an efficient and safe alternative to local polynomial regression

Source URL: users.stat.umn.edu

1 High-speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems Donald Donglong Chen, Nele Mentens, Frederik Vercauteren, Sujoy Sinha Roy, Ray C.C. Cheung, Derek Pao, and Ingrid Verbauwhede

Source URL: homes.esat.kuleuven.be