Local Testing for Membership in Lattices

DOI10.4230/LIPIcs.FSTTCS.2016.46zbMath1391.68121arXiv1608.00180OpenAlexW2964168370MaRDI QIDQ4636596

Venkata Gandikota, Elena Grigorescu, Mahdi Cheraghchi, Karthekeyan Chandrasekaran

Publication date: 19 April 2018

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

zbMATH Keywords

latticescomplexity theoryproperty testinglocally testable codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (1)

Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time

This page was built for publication: Local Testing for Membership in Lattices