Abstract Combinatorial Programs and Efficient Property Testers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1241385
- Fundamentals of Computation Theory
- Property testers for dense constraint satisfaction programs on finite domains
- Combinatorial PCPs with efficient verifiers
- scientific article; zbMATH DE number 5856093
- scientific article; zbMATH DE number 1737608
- Proofs, Programs and Abstract Complexity
- A formal logic approach to constrained combinatorial testing
- On the average-case complexity of property testing
Cited in
(16)- A large lower bound on the query complexity of a simple Boolean function
- Testing hypergraph colorability
- Testing metric properties
- Tolerant property testing and distance approximation
- scientific article; zbMATH DE number 1670655 (Why is no real title available?)
- Search and test algorithms for triple product property triples.
- Property testers for dense constraint satisfaction programs on finite domains
- Approximate membership for regular languages modulo the edit distance
- scientific article; zbMATH DE number 1875421 (Why is no real title available?)
- Testing Expansion in Bounded-Degree Graphs
- Sublinear-time Algorithms
- On the benefits of adaptivity in property testing of dense graphs
- Property testing of LP-type problems
- A fast coloring oracle for average case hypergraphs
- Property testing of the Boolean and binary rank
- Small space representations for metric min-sum k-clustering and their applications
This page was built for publication: Abstract Combinatorial Programs and Efficient Property Testers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317165)
