Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications

DOI10.1007/978-3-662-43948-7_79zbMath1376.11005arXiv1210.6917OpenAlexW2952062203MaRDI QIDQ5167806

Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf, Eli Ben-Sasson

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6917

zbMATH Keywords

Chernoff's boundalmost-periodicity lemma

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (1)

Finite field models in arithmetic combinatorics -- ten years on

This page was built for publication: Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications