scientific article; zbMATH DE number 3733656

MaRDI QIDQ3920993zbMATH OpenFDO

Authors Sergey P. Tarasov, Leonid G. Khachiyan

Publication date 1980

zbMATH Keywords

algorithmic complexitybounds of solutionsconvex Diophantine inequalitiesconvex polynomial inequalities

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Linear Diophantine equations (11D04) Diophantine inequalities (11D75) Numerical computation of solutions to systems of equations (65H10) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited in

(2)

• Une borne optimale pour la programmation entière quasi-convexe
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3920993)