A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed
Alexander I. BarvinokPublished in: FOCS (1993)
Keyphrases
- computational complexity
- learning algorithm
- detection algorithm
- convex hull
- cost function
- expectation maximization
- optimization algorithm
- np hard
- computational cost
- matching algorithm
- worst case
- search space
- probabilistic model
- preprocessing
- randomized algorithm
- extreme points
- polynomial time approximation
- particle swarm optimization
- high accuracy
- k means
- lower bound
- optimal solution