A. K. Kel'mans, “The existence of a “most complex” problem in the class of problems verifiable in nonpolynomial time”, Dokl. Akad. Nauk SSSR, 1985, Volume 282, Number 6,Pages <nobr>1299

JOURNALS // Doklady Akademii Nauk // Archive

Dokl. Akad. Nauk SSSR, 1985 Volume 282, Number 6, Pages 1299–1303 (Mi dan9098)

MATHEMATICS

The existence of a “most complex” problem in the class of problems verifiable in nonpolynomial time

A. K. Kel'mans

Institute of Control Sciences, Moscow

UDC: 519.7

Presented: L. V. Kantorovich
Received: 14.08.1984

Fulltext: PDF file (795 kB)

Bibliographic databases: