Lower time bounds for integer programming with two variables
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- The computational complexity of integer programming with alternations
- A linear algorithm for integer programming in the plane
- On the limits of computations with the floor function
- scientific article; zbMATH DE number 1405787 (Why is no real title available?)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- scientific article; zbMATH DE number 1757949 (Why is no real title available?)
- Integer programming in an algebraic computation model
- The computational complexity of integer programming with alternations
- Fast exponentiation using the truncation operation
- 3-valued problem and reduction of some integer programming problems
- Algorithms and Computation
This page was built for publication: Lower time bounds for integer programming with two variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072938)