Title of article :
Linear codes are hard for oblivious read-once parity branching programs
Author/Authors :
Stasys Jukna، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Pages :
3
From page :
267
To page :
269
Keywords :
computational complexity , Parity branching programs , Linear codes , Computer aided design , lower bounds
Journal title :
Information Processing Letters
Serial Year :
1999
Journal title :
Information Processing Letters
Record number :
129051
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129051
