Pages that link to "Item:Q5317165"
From MaRDI portal
The following pages link to Abstract Combinatorial Programs and Efficient Property Testers (Q5317165):
Displaying 12 items.
- Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Testing metric properties (Q1877548) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Search and test algorithms for triple product property triples. (Q2905579) (← links)
- Property testers for dense constraint satisfaction programs on finite domains (Q3150197) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)