Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning

Discrete and Computational Geometry - United States
doi 10.1007/s00454-019-00075-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Optimal Set Partitioning, Matchings and Lagrangian Duality

Naval Research Logistics Quarterly
1979English

Description of the Connected Components of a Semialgebraic Set in Single Exponential Time

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1994English

Convex Computation of the Maximum Controlled Invariant Set for Discrete-Time Polynomial Control Systems

2013English

Polynomial and Rational First Integrals for Planar Homogeneous Polynomial Differential Systems

Publicacions Matematiques
Mathematics
2014English

Sine-Cosine Polynomial Systems

1996English

Integral Simplex Using Decomposition for the Set Partitioning Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2014English

Dynamic Aggregation of Set-Partitioning Constraints in Column Generation

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2005English

Semialgebraic Description of Teichmüller Space

Publications of the Research Institute for Mathematical Sciences
Mathematics
1997English

Invariant Algebraic Sets and Symmetrization of Polynomial Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy