![]() |
Volumn 90, Issue 6, 2004, Pages 301-305
|
A lower bound for testing juntas
|
Author keywords
Boolean functions; Computational complexity; Property testing; Randomized algorithms
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTER SCIENCE;
INFORMATION SCIENCE;
POLYNOMIALS;
PROBABILITY;
PROBLEM SOLVING;
QUERY LANGUAGES;
RANDOM PROCESSES;
THEOREM PROVING;
PROPERTY TESTING;
QUERY COMPLEXITY;
RANDOM FUNCTIONS;
RANDOMIZED ALGORITHMS;
BOOLEAN FUNCTIONS;
|
EID: 2442542636
PISSN: 00200190
EISSN: None
Source Type: Journal
DOI: 10.1016/j.ipl.2004.01.023 Document Type: Article |
Times cited : (61)
|
References (13)
|