مرکز منطقه ای اطلاع رساني علوم و فناوري - Lower bounds on the complexity of recognizing SAT by Turing machines

Title of article :

Lower bounds on the complexity of recognizing SAT by Turing machines

Author/Authors :

Rahul Santhanam، نويسنده ,

Issue Information :

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

Pages :

From page :

243

To page :

247

Keywords :

computational complexity , time-space tradeoffs , Satisfiability

Journal title :

Information Processing Letters

Serial Year :

2001

Journal title :

Information Processing Letters

Record number :

129380

Link To Document :