scientific article

DOI10.4086/toc.2006.v002a009zbMath1213.68414OpenAlexW3037006179MaRDI QIDQ3002771

Eldar Fischer, Lance J. Fortnow

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2006.v002a009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

property testingPCP of proximitytolerant testing

Mathematics Subject Classification ID

Randomized algorithms (68W20) Theory of computing (68Q99)

Related Items (8)

Erasures versus errors in local decoding and property testing ⋮ Approximating the distance to monotonicity of Boolean functions ⋮ Unnamed Item ⋮ Erasure-Resilient Property Testing ⋮ Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Earthmover Resilience and Testing in Ordered Structures

This page was built for publication: