文章基本信息

标题：Complexity of Nondeterministic Functions
本地全文：下载
作者：Alexander E. Andreev
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：1994
卷号：1
期号：2
出版社：Aarhus University
摘要：The complexity of a nondeterministic function is the minimum possible complexity of its determinisation. The entropy of a nondeterministic function, F, is minus the logarithm of the ratio between the number of determinisations of F and the number of all deterministic functions. We obtain an upper bound on the complexity of a nondeterministic function with restricted entropy for the worst case. These bounds have strong applications in the problem of algorithm derandomization. A lot of randomized algorithms can be converted to deterministic ones if we have an effective hitting set with certain parameters (a set is hitting for a set system if it has a nonempty intersection with any set from the system). Linial, Luby, Saks and Zuckerman (1993) constructed the best effective hitting set for the system of k-value, n-dimensional rectangles. The set size is polynomial in k log n / epsilon. Our bounds of nondeterministic functions complexity offer a possibility to construct an effective hitting set for this system with almost linear size in k log n / epsilon.