مرکز منطقه ای اطلاع رساني علوم و فناوري - On the P versus NP intersected with co-NP question in communication complexity

Title of article :

On the P versus NP intersected with co-NP question in communication complexity

Author/Authors :

Stasys Jukna، نويسنده ,

Issue Information :

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

Pages :

From page :

202

To page :

206

Keywords :

Communication complexity , computational complexity

Journal title :

Information Processing Letters

Serial Year :

2005

Journal title :

Information Processing Letters

Record number :

130168

Link To Document :