Namespaces
Variants
Actions

Lenstra polynomial-time theorem

From Encyclopedia of Mathematics
Jump to: navigation, search

A result in integer programming. It states that integer programming problems in a fixed number of variables can be solved in polynomial time.

References

[a1] H.W. Lenstra, "Integer programming with a fixed number of variables" Math. of Oper. Res. , 8 : 4 (1983) pp. 538–548
How to Cite This Entry:
Lenstra polynomial-time theorem. M. Hazewinkel (originator), Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Lenstra_polynomial-time_theorem&oldid=12050
This text originally appeared in Encyclopedia of Mathematics - ISBN 1402006098