An improved dictatorship test with perfect completeness

Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A Boolean function f : (0, 1)n (0, 1) is called a dictator if it depends on exactly one variable i.e f(x1, x2, . . ., xn) = xi for some i (n). In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems. The dictatorship test is said to have perfect completeness if it accepts any dictator function. The soundness of a test is the maximum probability with which it accepts any function far from a dictator. Our main result is a k-query dictatorship test with perfect completeness and soundness 2k 2 +1 k, where k is of the form 2t-1 for any integer t 2. This improves upon the result of (25) which gave a dictatorship test with soundness 2k 2 +3 k.

Original languageEnglish (US)
Title of host publication37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume93
ISBN (Electronic)9783959770552
DOIs
StatePublished - Jan 1 2018
Event37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017 - Kanpur, India
Duration: Dec 12 2017Dec 14 2017

Other

Other37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017
CountryIndia
CityKanpur
Period12/12/1712/14/17

Fingerprint

Constraint satisfaction problems
Boolean functions
Hardness

Keywords

  • Distatorship Test
  • Fourier Analysis
  • Property Testing

ASJC Scopus subject areas

  • Software

Cite this

Bhangale, A., Khot, S., & Thiruvenkatachari, D. (2018). An improved dictatorship test with perfect completeness. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017 (Vol. 93). [15] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSTTCS.2017.15

An improved dictatorship test with perfect completeness. / Bhangale, Amey; Khot, Subhash; Thiruvenkatachari, Devanathan.

37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. Vol. 93 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. 15.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bhangale, A, Khot, S & Thiruvenkatachari, D 2018, An improved dictatorship test with perfect completeness. in 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. vol. 93, 15, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, Kanpur, India, 12/12/17. https://doi.org/10.4230/LIPIcs.FSTTCS.2017.15
Bhangale A, Khot S, Thiruvenkatachari D. An improved dictatorship test with perfect completeness. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. Vol. 93. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. 15 https://doi.org/10.4230/LIPIcs.FSTTCS.2017.15
Bhangale, Amey ; Khot, Subhash ; Thiruvenkatachari, Devanathan. / An improved dictatorship test with perfect completeness. 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. Vol. 93 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.
@inproceedings{d8d453d454b345bbbf6fd58341f063fc,
title = "An improved dictatorship test with perfect completeness",
abstract = "A Boolean function f : (0, 1)n (0, 1) is called a dictator if it depends on exactly one variable i.e f(x1, x2, . . ., xn) = xi for some i (n). In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems. The dictatorship test is said to have perfect completeness if it accepts any dictator function. The soundness of a test is the maximum probability with which it accepts any function far from a dictator. Our main result is a k-query dictatorship test with perfect completeness and soundness 2k 2 +1 k, where k is of the form 2t-1 for any integer t 2. This improves upon the result of (25) which gave a dictatorship test with soundness 2k 2 +3 k.",
keywords = "Distatorship Test, Fourier Analysis, Property Testing",
author = "Amey Bhangale and Subhash Khot and Devanathan Thiruvenkatachari",
year = "2018",
month = "1",
day = "1",
doi = "10.4230/LIPIcs.FSTTCS.2017.15",
language = "English (US)",
volume = "93",
booktitle = "37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
address = "Germany",

}

TY - GEN

T1 - An improved dictatorship test with perfect completeness

AU - Bhangale, Amey

AU - Khot, Subhash

AU - Thiruvenkatachari, Devanathan

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A Boolean function f : (0, 1)n (0, 1) is called a dictator if it depends on exactly one variable i.e f(x1, x2, . . ., xn) = xi for some i (n). In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems. The dictatorship test is said to have perfect completeness if it accepts any dictator function. The soundness of a test is the maximum probability with which it accepts any function far from a dictator. Our main result is a k-query dictatorship test with perfect completeness and soundness 2k 2 +1 k, where k is of the form 2t-1 for any integer t 2. This improves upon the result of (25) which gave a dictatorship test with soundness 2k 2 +3 k.

AB - A Boolean function f : (0, 1)n (0, 1) is called a dictator if it depends on exactly one variable i.e f(x1, x2, . . ., xn) = xi for some i (n). In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems. The dictatorship test is said to have perfect completeness if it accepts any dictator function. The soundness of a test is the maximum probability with which it accepts any function far from a dictator. Our main result is a k-query dictatorship test with perfect completeness and soundness 2k 2 +1 k, where k is of the form 2t-1 for any integer t 2. This improves upon the result of (25) which gave a dictatorship test with soundness 2k 2 +3 k.

KW - Distatorship Test

KW - Fourier Analysis

KW - Property Testing

UR - http://www.scopus.com/inward/record.url?scp=85043997421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85043997421&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.FSTTCS.2017.15

DO - 10.4230/LIPIcs.FSTTCS.2017.15

M3 - Conference contribution

VL - 93

BT - 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -