Internet Archive Scholar

On properties of counting functions with easy decision version: completeness, approximability, Markov chains, phase transitions [article]

Eleni Bakali, National Technological University Of Athens
2020

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.7 MB)
https://web.archive.org/web/20200726044951/https://dspace.lib.ntua.gr/xmlui/bitstream/handle/123456789/50960/final-phd-thesis.pdf;jsessionid=24A5B722F80B3B022F98652AAF12A9A8?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

We identify a family of hard instances for the TotP-complete problem Size-of-Subtree: the so called Christmas-trees. This family of trees contains all full complete binary trees, and all trees that consist of a full complete binary tree of height n, from a leaf of which is hanging another full complete binary tree of the same height n, for all n. Theorem: If an upper bound of the height of the tree is given, we cannot approximate the size of Christmas-trees (given in succinct representation).
more » ... oof sketch: We map unsatisfiable formulas to trees of case 1, and uniquely satisfiable formulas to trees of case 2. If we could approximate Christmas-trees, we could distinguish between case 1 and 2, and thus solve USAT.
doi:10.26240/heal.ntua.18658 fatcat:y6flt63dzrel3cazjseidduucy
Open Access
Citation

Eleni Bakali, National Technological University Of Athens. "On properties of counting functions with easy decision version: completeness, approximability, Markov chains, phase transitions." (2020)