Title of article :
A recursion-theoretic approach to NP
Author/Authors :
Oitavem، نويسنده , , I.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Abstract :
An implicit characterization of the class NP is given, without using any minimization scheme. This is the first purely recursion-theoretic formulation of NP .
Keywords :
computational complexity , Implicit characterization , Recursion schemes , NP
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic
