A Polynomial Time Algorithm for Constructing the Refined Buneman tree David Bryant CRM, Universit´e de Montr´eal, CP 6128 Succeursale Centre-ville, Montr´eal, Quebec H3C 3J7

Source URL: www.maths.otago.ac.nz

Graph-Theoretic Algorithms for Polynomial Optimization Problems Somayeh Sojoudi, Ramtin Madani, Ghazal Fazelnia, and Javad Lavaei Abstract— The objective of this tutorial paper is to study a general polynomial optimiza

Source URL: www.ieor.berkeley.edu

J´erˆome Leroux Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

Source URL: www.labri.fr

• Mathematics
• Algebra
• Mathematical logic
• Logic in computer science
• Model theory
• Proof theory
• Presburger arithmetic
• Time complexity
• Generalized arithmetic progression
• Polynomial
• Vector space
• Lattice

A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries MARK JERRUM University of Edinburgh, Edinburgh, United Kingdom ALISTAIR SINCLAIR

Source URL: www.cc.gatech.edu

On Polynomial Systems Arising from a Weil Descent Christophe Petit? and Jean-Jacques Quisquater?? UCL Crypto Group, Universit´e catholique de Louvain Place du LevantLouvain-la-Neuve (Belgium)

Source URL: www.uclouvain.be

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints T. K. Satish Kumar?† , Duc Thien Nguyen‡ , William Yeoh†† , and Sven Koenig† † Department of Computer Science

Source URL: www.cs.nmsu.edu

Polynomial Spline Surfaces with Rational Linear Transitions J¨org Peters, Martin Sarov, University of Florida Abstract We explore a class of polynomial tensor-product spline surfaces on 3-6 polyhedra, whose vertices hav

Source URL: www.cise.ufl.edu

Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals Kazutaka Matsuda Tohoku University

Source URL: www2.sf.ecei.tohoku.ac.jp

• Mathematics
• Special functions
• Declarative programming
• Automated theorem proving
• Logic programming
• Data types
• Functional programming
• Logical truth
• Substitution
• Cons
• Exponentiation
• Inverse trigonometric functions

A COMPACTNESS ARGUMENT IN THE ADDITIVE THEORY AND THE POLYNOMIAL METHOD 1 ´

Source URL: www.cs.elte.hu