Markó, Roland: On Approximability, Convergence, and Limits of CSP Problems. - Bonn, 2016. - Dissertation, Rheinische Friedrich-Wilhelms-Universität Bonn.
Online-Ausgabe in bonndoc: https://nbn-resolving.org/urn:nbn:de:hbz:5n-44773
@phdthesis{handle:20.500.11811/6885,
urn: https://nbn-resolving.org/urn:nbn:de:hbz:5n-44773,
author = {{Roland Markó}},
title = {On Approximability, Convergence, and Limits of CSP Problems},
school = {Rheinische Friedrich-Wilhelms-Universität Bonn},
year = 2016,
month = sep,

note = {This thesis studies dense constraint satisfaction problems (CSPs), and other related optimization and decision problems that can be phrased as questions regarding parameters or properties of combinatorial objects such as uniform hypergraphs. We concentrate on the information that can be derived from a very small substructure that is selected uniformly at random.
In this thesis, we present a unified framework on the limits of CSPs in the sense of the convergence notion of Lovasz-Szegedy that depends only on the remarkable connection between graph sequences and exchangeable arrays established by Diaconis-Janson. In particular, we formulate and prove a representation theorem for compact colored r-uniform directed hypergraphs and apply this to rCSPs.
We investigate the sample complexity of testable r-graph parameters, and discuss a generalized version of ground state energies (GSE) and demonstrate that they are efficiently testable. The GSE is a term borrowed from statistical physics that stands for a generalized version of maximal multiway cut problems from complexity theory, and was studied in the dense graph setting by Borgs et al.
A notion related to testing CSPs that are defined on graphs, the nondeterministic property testing, was introduced by Lovasz-Vesztergombi, which extends the graph property testing framework of Goldreich-Goldwasser-Ron in the dense graph model. In this thesis, we study the sample complexity of nondeterministically testable graph parameters and properties and improve existing bounds by several orders of magnitude. Further, we prove the equivalence of the notions of nondeterministic and deterministic parameter and property testing for uniform dense hypergraphs of arbitrary rank, and provide the first effective upper bound on the sample complexity in this general case.},

url = {http://hdl.handle.net/20.500.11811/6885}
}

The following license files are associated with this item:

InCopyright