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
Keywords :
computational complexity , Read-once branching programs , nondeterminism , lower bounds , Depth-restricted circuits
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
