Testing Low Complexity Affine-Invariant Properties

DOI10.1137/1.9781611973105.97zbMath1423.11204arXiv1201.0330OpenAlexW2950938138MaRDI QIDQ5741806

Arnab Bhattacharyya, Shachar Lovett, Eldar Fischer

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

affine-invariant properties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (4)

Testing Linear-Invariant Properties ⋮ Unnamed Item ⋮ General systems of linear forms: equidistribution and true complexity ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity

This page was built for publication: Testing Low Complexity Affine-Invariant Properties