Property testing of massively parametrized problems -- a survey
From MaRDI portal
(Redirected from Publication:4933366)
Recommendations
Cites work
- An extremal function for contractions of graphs
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- Monotonicity testing over general poset domains
- On the Query Complexity of Testing Orientations for Being Eulerian
- On the strength of comparisons in property testing
- Property testing and its connection to learning and approximation
- Regular languages are testable with a constant number of queries
- Some 3CNF Properties Are Hard to Test
- Space complexity vs. query complexity
- Testing Membership in Languages that Have Small Width Branching Programs
- Testing properties of directed graphs: acyclicity and connectivity*
- Testing st-Connectivity
- Testing subgraphs in large graphs
- The PCP theorem by gap amplification
- Transitive-closure spanners
Cited in
(10)- Proofs of proximity for context-free languages and read-once branching programs
- Non-interactive proofs of proximity
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- Short locally testable codes and proofs
- A Brief Introduction to Property Testing
- Testing list H-homomorphisms
- Testing for forbidden posets in ordered rooted forests
- The subgraph testing model
- Constant-query testability of assignments to constraint satisfaction problems
- An algebraic characterization of testable Boolean CSPs
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)
