Title of article :
A large lower bound on the query complexity of a simple boolean function
Author/Authors :
Beate Bollig، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2005
Pages :
6
From page :
423
To page :
428
Keywords :
branching programs , computational complexity , property testing , Query complexity , randomized algorithms
Journal title :
Information Processing Letters
Serial Year :
2005
Journal title :
Information Processing Letters
Record number :
130116
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130116
