Title of article
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Author/Authors
Beate Bollig، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
6
From page
143
To page
148
Keywords
computational complexity , Read-once branching programs , nondeterminism , lower bounds , Depth-restricted circuits
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129701
Link To Document