مرکز منطقه ای اطلاع رساني علوم و فناوري - Functions computable with limited access to NP

Title of article :

Functions computable with limited access to NP

Author/Authors :

Mitsunori Ogihara، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1996

Pages :

From page :

To page :

Keywords :

computational complexity , Nondetenninistic functions , Reducibility , polynomial hierarchy

Journal title :

Information Processing Letters

Serial Year :

1996

Journal title :

Information Processing Letters

Record number :

128460

Link To Document :