|
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
Citation:
A. K. Kel'mans, “The existence of a “most complex” problem in the class of
problems verifiable in nonpolynomial time”, Dokl. Akad. Nauk SSSR, 282:6 (1985), 1299–1303
Linking options:
https://www.mathnet.ru/eng/dan9098 https://www.mathnet.ru/eng/dan/v282/i6/p1299
|
Statistics & downloads: |
Abstract page: | 89 | Full-text PDF : | 32 |
|