|
This article is cited in 4 scientific papers (total in 4 papers)
Reducibilities of tabular type in the theory of algorithms
A. N. Degtev
Citation:
A. N. Degtev, “Reducibilities of tabular type in the theory of algorithms”, Uspekhi Mat. Nauk, 34:3(207) (1979), 137–168; Russian Math. Surveys, 34:3 (1979), 155–192
Linking options:
https://www.mathnet.ru/eng/rm7179https://doi.org/10.1070/RM1979v034n03ABEH003988 https://www.mathnet.ru/eng/rm/v34/i3/p137
|
Statistics & downloads: |
Abstract page: | 276 | Russian version PDF: | 131 | English version PDF: | 12 | References: | 49 | First page: | 1 |
|