مرکز منطقه ای اطلاع رساني علوم و فناوري - Succinct circuit representations and leaf language classes are basically the same concept

Title of article :

Succinct circuit representations and leaf language classes are basically the same concept

Author/Authors :

Bernd Borchert، نويسنده , , Antoni Lozano، نويسنده ,

Issue Information :

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

Pages :

From page :

211

To page :

215

Keywords :

computational complexity , Leaf language classes , Succinct representations , Polynomial-time many-one completeness

Journal title :

Information Processing Letters

Serial Year :

1996

Journal title :

Information Processing Letters

Record number :

128537

Link To Document :