Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks...

Full description

Bibliographic Details
Main Author: Huang, Sangxia
Format: Doctoral Thesis
Language:English
Published: KTH, Teoretisk datalogi, TCS 2015
Subjects:
Combinatorial optimization
approximation
inapproximability
hardness
probabilistically checkable proofs
pcp
perfect completeness
boolean constraint satisfaction problem
csp
graph coloring
hypergraph coloring
direct sum
superposition
label cover
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168576
http://nbn-resolving.de/urn:isbn:978-91-7595-633-6

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168576
http://nbn-resolving.de/urn:isbn:978-91-7595-633-6

Similar Items