Reference52 articles.
1. M. M. Arslanov, On a class of hypersimple incomplete sets. Mat. Zametki 38(1985), 872–874 (Russian); Math. Notes 38(1985), 984–985 (English translation).
2. O.V. Belegradek. On Algebraically closed groups, Algebra i Logika, 13, No. 3 (1974), 813–816 (Russian).
3. M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. Comp. Mach. 14, No. 2 (1967), 322–336.
4. M. Blum, On the size of machines, Inform, and Control, 11, No. 3 (1967), 257–265.
5. M. Blum, I. Marques, On complexity properties of recursively enumerable sets, J. Symb. Logic, 38, No. 4 (1973), 579–593.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献