Lower time bounds for integer programming with two variables

DOI10.1016/0020-0190(85)90042-0zbMath0587.90072OpenAlexW2088530796MaRDI QIDQ1072938

Friedhelm Meyer auf der Heide, Clemens Lautemann

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90042-0

zbMATH Keywords

polynomial algorithmrecognition problemfloor functionalgebraic computation treecomputation with polynomial orderlower time bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items

Fast exponentiation using the truncation operation ⋮ On the limits of computations with the floor function

Cites Work

• Integer programming and cryptography
• A lower time bound for the knapsack problem on random access machines
• Unnamed Item
• Unnamed Item