Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PERFECT COMPLETENESS:
Reports tagged with Perfect Completeness:
TR02-040 | 20th June 2002
Lars Engebretsen, Jonas Holmerin

Three-Query PCPs with Perfect Completeness over non-Boolean Domains

We study non-Boolean PCPs that have perfect completeness and read
three positions from the proof. For the case when the proof consists
of values from a domain of size d for some integer constant d
>= 2, we construct a non-adaptive PCP with perfect completeness
more >>>


TR12-145 | 31st October 2012
Cenny Wenner

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four

Håstad established that any predicate P \subseteq \{0,1\}^m containing parity of width at least three is approximation resistant for almost satisfiable instances. However, in comparison to for example the approximation hardness of Max-3SAT, the result only holds for almost satisfiable instances. This limitation was addressed by O'Donnell, Wu, and Huang ... more >>>


TR17-030 | 15th February 2017
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari

An Improved Dictatorship Test with Perfect Completeness

A Boolean function f:\{0,1\}^n\rightarrow \{0,1\} is called a dictator if it depends on exactly one variable i.e f(x_1, x_2, \ldots, x_n) = x_i for some i\in [n]. In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems.

... more >>>

TR22-061 | 30th April 2022
Amey Bhangale, Subhash Khot, Dor Minzer

On Approximability of Satisfiable k-CSPs: I

We consider the P-CSP problem for 3-ary predicates P on satisfiable instances. We show that under certain conditions on P and a (1,s) integrality gap instance of the P-CSP problem, it can be translated into a dictatorship vs. quasirandomness test with perfect completeness and soundness s+\varepsilon, for every constant \varepsilon>0. ... more >>>


TR23-123 | 21st August 2023
Noam Mazor

Key-Agreement with Perfect Completeness from Random Oracles

In the Random Oracle Model (ROM) all parties have oracle access to a common random function, and the parties are limited in the number of queries they can make to the oracle. The Merkle’s Puzzles protocol, introduced by Merkle [CACM ’78], is a key-agreement protocol in the ROM with a ... more >>>




ISSN 1433-8092 | Imprint