Byerly R. E. ...


Byerly R. E.
[1984]
Definability of recursively enumerable sets in abstract computational complexity
Z. math. Logik und Grundl. Math., 30, № 6, 499-503
85.08.51
article

Вернуться к поиску