Hardness of Sparse Sets and Minimal Circuit Size Problem

Abstract

We study the magnification of hardness of sparse sets in nondeterministic time complexity classes on a randomized streaming model. One of our results shows that if there exists a -sparse set in that does not have any randomized streaming algorithm with updating time, and space, then, where a f(n)-sparse set is a language that has at most f(n) strings of length n. We also show that if-hard under polynomial time truth-table reductions, then.