Repository | Book | Chapter
(1987) Mathematical logic and its applications, Dordrecht, Springer.
One of the main ways of attacking the famous P = ?NP problem and its associates consists in the consideration of some classical tools from the recursive function theory (different kind of reducibilities, relativization, immunity, a.s.o.) in complexity bounded forms.
Publication details
DOI: 10.1007/978-1-4613-0897-3_27
Full citation:
Zimand, M. (1987)., Complexity bounded Martin-Löf tests, in D. G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, pp. 351-359.
This document is unfortunately not available for download at the moment.