Pages that link to "Item:Q5190073"
From MaRDI portal
The following pages link to lgorithmic and Analysis Techniques in Property Testing (Q5190073):
Displaying 50 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Sorting and selection on dynamic data (Q541657) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Testing shape restrictions of discrete distributions (Q1702847) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Testing piecewise functions (Q1786590) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Testing properties of functions on finite groups (Q2830241) (← links)
- Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling (Q2830613) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Randomness and Computation (Q3088199) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Big Data on the Rise? (Q3448793) (← links)
- (Q4612483) (← links)
- TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS (Q4923287) (← links)
- A Brief Introduction to Property Testing (Q4933359) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5090414) (← links)
- (Q5090430) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- Partially Symmetric Functions Are Efficiently Isomorphism Testable (Q5252692) (← links)
- Testing Probability Distributions using Conditional Samples (Q5255008) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894226) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Discrimination of quantum states under locality constraints in the many-copy setting (Q6057279) (← links)
- On one-sided testing affine subspaces (Q6057325) (← links)