DNF complexity of complete boolean functions
Combinatorics
2015-01-08 v1 Computational Complexity
Abstract
In this paper we analyse the complexity of boolean functions takes value 0 on a sufficiently small number of points. For many functions this leads to the analysis of a single function attains 0 only on unsigned representation of numbers from 1 to d for various d. Here we obtain a tight bounds on the DNF complexity of complete functions in terms of the number of literals and conjunctions. The method is based on a certain efficient approximation of the hypercube covering problem related to DNF complexity of a given boolean function.
Cite
@article{arxiv.1501.01331,
title = {DNF complexity of complete boolean functions},
author = {Yura Maximov},
journal= {arXiv preprint arXiv:1501.01331},
year = {2015}
}
Comments
19 pages, 1 figure, in Russian