Algorithmic and complexity results for boolean and pseudo-boolean functions

### Citation & ExportHide

#### Simple citation

Gruber, Aritanan G..

**Algorithmic and complexity results for boolean and pseudo-boolean functions.**Retrieved from https://doi.org/doi:10.7282/T3PZ5BHQ#### Export

### StatisticsHide

### Description

TitleAlgorithmic and complexity results for boolean and pseudo-boolean functions

NameGruber, Aritanan G. (author); Boros, Endre (chair); BEN-ISRAEL, ADI (co-chair); Kogan, Alexander (internal member); Gurvich, Vladimir (internal member); Cepek, Ondrej (outside member); Rutgers University; Graduate School - New Brunswick

Date Created2015

Other Date2015-01 (degree)

Extent1 online resource (x, 194 p. : ill.)

DescriptionThis dissertation presents our contributions to two problems. In the first problem, we study the hardness of approximation of clause minimum and literal minimum representations of pure Horn functions in $n$ Boolean variables. We show that unless P=NP, it is not possible to approximate in polynomial time the minimum number of clauses and the minimum number of literals of pure Horn CNF representations to within a factor of $2^{log^{1-o(1)} n}$. This is the case even when the inputs are restricted to pure Horn 3-CNFs with $O(n^{1+varepsilon})$ clauses, for some small positive constant $varepsilon$. Furthermore, we show that even allowing sub-exponential time computation, it is still not possible to obtain constant factor approximations for such problems unless the Exponential Time Hypothesis is false. In the second problem, we study quadratizations of pseudo-Boolean functions, that is, transformations that given a pseudo-Boolean function $f(x)$ in $n$ variables, produce a quadratic pseudo-Boolean function $g(x,y)$ in $n+m$ variables such that $f(x) = min_{yinB^m} g(x,y)$ for all $xinB^n$. We present some new termwise procedures, leading to improved experimental results, and then take a global perspective and start a systematic investigation of some structural properties of the class of all quadratizations of a given function. We show that all pseudo-Boolean functions in $n$ variables can be quadratized and $y$-linear quadratized (no quadratic products involving solely auxiliary variables) with at most $O(2^{n/2})$ and $Obigl(frac{2^n}{n}log nbigr)$ auxiliary variables, respectively, and that almost all those functions require $Omega(2^{n/2})$ and $Omega(2^n/n)$ auxiliary variables in any quadratization and any $y$-linear quadratization, respectively. We obtain the bounds $O(n^{d/2})$ and $Omega(n^{d/2})$ for quadratizations of degree-$d$ pseudo-Boolean functions, and bounds of $n-2$ and $Omega(n/log n)$ for $y$-linear quadratizations (and $Omega(oldsqrt{n})$ for quadratizations) of symmetric pseudo-Boolean functions. All our upper bounds are constructive, so they provide new ($y$-linear) quadratization algorithms. We then finish with a characterization of the set of all quadratizations of negative monomials with one auxiliary variable, a result that was surprisingly difficult to obtain, and whose proof at the moment is rather long and intricate.

NotePh.D.

NoteIncludes bibliographical references

Noteby Aritanan G. Gruber

Genretheses

Persistent URLhttps://doi.org/doi:10.7282/T3PZ5BHQ

Languageeng

CollectionGraduate School - New Brunswick Electronic Theses and Dissertations

Organization NameRutgers, The State University of New Jersey

RightsThe author owns the copyright to this work.