Property testing of massively parametrized problems -- a survey
From MaRDI portal
Publication:4933366
DOI10.1007/978-3-642-16367-8_8zbMATH Open1309.68227OpenAlexW1602276996MaRDI QIDQ4933366FDOQ4933366
Publication date: 12 October 2010
Published in: Property Testing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_8
Recommendations
Cites Work
- Property testing and its connection to learning and approximation
- Title not available (Why is that?)
- An extremal function for contractions of graphs
- On the Query Complexity of Testing Orientations for Being Eulerian
- Monotonicity testing over general poset domains
- Testing st-Connectivity
- Transitive-Closure Spanners
- Some 3CNF Properties Are Hard to Test
- Testing subgraphs in large graphs
- Regular languages are testable with a constant number of queries
- Testing Membership in Languages that Have Small Width Branching Programs
- Title not available (Why is that?)
- Testing properties of directed graphs: acyclicity and connectivity*
- Space complexity vs. query complexity
- On the strength of comparisons in property testing
- The PCP theorem by gap amplification
Cited In (10)
- Title not available (Why is that?)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- Non-interactive proofs of proximity
- A Brief Introduction to Property Testing
- Proofs of proximity for context-free languages and read-once branching programs
- Testing list \(H\)-homomorphisms
- An Algebraic Characterization of Testable Boolean CSPs
- TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS
- Short Locally Testable Codes and Proofs
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems
This page was built for publication: Property testing of massively parametrized problems -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933366)
