Computing the Ehrhart Quasi-Polynomial of a Rational Simplex

Mathematics of Computation - United States
doi 10.1090/s0025-5718-06-01836-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Three Ehrhart Quasi-Polynomials

Algebraic Combinatorics
2019English

Computing Images of Polynomial Maps

Advances in Computational Mathematics
Computational MathematicsApplied Mathematics
2019English

Search Techniques for Rational Polynomial Orders

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Polynomial and Rational First Integrals for Planar Homogeneous Polynomial Differential Systems

Publicacions Matematiques
Mathematics
2014English

A Refined Error Analysis for Fixed-Degree Polynomial Optimization Over the Simplex

Journal of the Operations Research Society of China
Management ScienceApplied MathematicsOperations ResearchMathematics
2014English

Quasi-Rational Canonical Forms of a Matrix Over a Number Field

Advances in Linear Algebra & Matrix Theory
2018English

A Generalized Eigenvalue Problem for Quasi-Orthogonal Rational Functions

Numerische Mathematik
Computational MathematicsApplied Mathematics
2011English

The Diophantine Problem for Polynomial Rings and Fields of Rational Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1978English

A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy