This paper deals with a philosophical question that arises within the theory of computational complexity: how to understand the notion of INTRINSIC complexity or difficulty, as opposed to notions of ...
Transactions of the American Mathematical Society, Vol. 363, No. 10 (OCTOBER 2011), pp. 5465-5480 (16 pages) Several classes of diagonally nonrecursive (DNR) functions are characterized in terms of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback