S. P. Tarasov, L. G. Khachiyan, “Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities”, Dokl. Akad. Nauk SSSR, 255:2 (1980), 296

Doklady Akademii Nauk SSSR

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Doklady Akademii Nauk SSSR, 1980, Volume 255, Number 2, Pages 296–300 (Mi dan44040)

MATHEMATICS

Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities

S. P. Tarasov, L. G. Khachiyan

Computing Centre, USSR Academy of Sciences, Moscow

Full-text PDF (676 kB)

Presented: A. A. Dorodnitsyn
Received: 25.06.1980

Bibliographic databases:

Document Type: Article

UDC: 519.95+511.54

Language: Russian

Citation: S. P. Tarasov, L. G. Khachiyan, “Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities”, Dokl. Akad. Nauk SSSR, 255:2 (1980), 296–300

Citation in format AMSBIB

\Bibitem{TarKha80}

\by S.~P.~Tarasov, L.~G.~Khachiyan

\paper Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities

\jour Dokl. Akad. Nauk SSSR

\yr 1980

\vol 255

\issue 2

\pages 296--300

\mathnet{http://mi.mathnet.ru/dan44040}

\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0593203}

\zmath{https://zbmath.org/?q=an:0467.90048}

Linking options:

https://www.mathnet.ru/eng/dan44040

https://www.mathnet.ru/eng/dan/v255/i2/p296

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Registration to the website

Logotypes