License:
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2022.9
URN: urn:nbn:de:0030-drops-171313
URL: https://drops.dagstuhl.de/opus/volltexte/2022/17131/
Huang, Xuangui ;
Ivanov, Peter ;
Viola, Emanuele
Affine Extractors and AC0-Parity
Abstract
We study a simple and general template for constructing affine extractors by composing a linear transformation with resilient functions. Using this we show that good affine extractors can be computed by non-explicit circuits of various types, including AC0-Xor circuits: AC0 circuits with a layer of parity gates at the input. We also show that one-sided extractors can be computed by small DNF-Xor circuits, and separate these circuits from other well-studied classes. As a further motivation for studying DNF-Xor circuits we show that if they can approximate inner product then small AC0-Xor circuits can compute it exactly - a long-standing open problem.
BibTeX - Entry
@InProceedings{huang_et_al:LIPIcs.APPROX/RANDOM.2022.9,
author = {Huang, Xuangui and Ivanov, Peter and Viola, Emanuele},
title = {{Affine Extractors and AC0-Parity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17131},
URN = {urn:nbn:de:0030-drops-171313},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.9},
annote = {Keywords: affine extractor, resilient function, constant-depth circuit, parity gate, inner product}
}
Keywords: |
|
affine extractor, resilient function, constant-depth circuit, parity gate, inner product |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) |
Issue Date: |
|
2022 |
Date of publication: |
|
15.09.2022 |