Title of article :
A note on a theorem of Barrington, Straubing and Thérien
Author/Authors :
Hervé Caussinus، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Pages :
3
From page :
31
To page :
33
Keywords :
computational complexity , lower bounds , polynomials
Journal title :
Information Processing Letters
Serial Year :
1996
Journal title :
Information Processing Letters
Record number :
128459
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128459
بازگشت