Pages that link to "Item:Q2706138"
From MaRDI portal
The following pages link to Regular Languages are Testable with a Constant Number of Queries (Q2706138):
Displaying 28 items.
- Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- Property Testing of Massively Parametrized Problems – A Survey (Q4933366) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- (Q5090383) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
- Testing membership for timed automata (Q6090987) (← links)
- Fully dynamic \(k\)-center clustering with outliers (Q6185941) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
