This 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.
Subject (authority = RUETD)
Topic
Operations Research
Subject (authority = ETD-LCSH)
Topic
Algebra, Boolean
Subject (authority = ETD-LCSH)
Topic
Algebraic functions
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_6033
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (x, 194 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Aritanan G. Gruber
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.