Search for dissertations about: "inapproximability theory"

Found 4 swedish dissertations containing the words inapproximability theory.

2. 1. Applications of Gaussian Noise Stability in Inapproximability and Social Choice Theory

   Author : Marcus Isaksson; Göteborgs universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Gaussian noise stability; inapproximability theory; invariance principle; max-q-cut; condorcet voting; max-q-cut;

   Abstract : Gaussian isoperimetric results have recently played an important role in proving fundamental results in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we prove a generalization of a Gaussian isoperimetric result by Borell and show that it implies that the majority function is optimal in Condorcet voting in the sense that it maximizes the probability that there is a single candidate which the society prefers over all other candidates. READ MORE

4. 2. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

   Author : Cenny Wenner; Johan Håstad; Viggo Kann; Irit Dinur; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; datalogi; Computer Science;

   Abstract : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). READ MORE

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

   Author : Sangxia Huang; Johan Håstad; Rishi Saket; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; 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; Computer Science; Datalogi;

   Abstract : 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 the validity of a PCP proof by reading only 3 bits from it. READ MORE

6. 4. Dividing the Indivisible : Algorithms, Empirical Advances, and Complexity Results for Value-Maximizing Combinatorial Assignment Problems

   Author : Fredrik Präntare; Fredrik Heintz; Patrick Doherty; Carles Sierra; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : Allocating resources, goods, agents (e.g., humans), expertise, production, and assets is one of the most influential and enduring cornerstone challenges at the intersection of artificial intelligence, operations research, politics, and economics. READ MORE