scientific article; zbMATH DE number 7650357

DOI10.4230/LIPICS.ITCS.2020.9MaRDI QIDQ5875702zbMATH OpenFDO

Authors Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum

Publication date 3 February 2023

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

zbMATH Keywords

coding theoryerasure resilient testingPCPPproperty testingrandomized encodingtolerant testing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(7)

• Sample-based distance-approximation for subsequence-freeness
• Property testing with online adversaries
• Support testing in the huge object model
• Local proofs approaching the witness length
• Property testing with online adversaries
• Erasure-resilient sublinear-time graph algorithms
• Let's try to be more tolerant: on tolerant property testing and distance approximation (invited talk)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875702)