scientific article; zbMATH DE number 5057523

zbMath1100.68041MaRDI QIDQ5491026

Ronitt Rubinfeld

Publication date: 26 September 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

property testingSublinear time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Sublinear-Time Algorithms for Tournament Graphs ⋮ Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs ⋮ Efficiently testing sparse \(\text{GF}(2)\) polynomials ⋮ Sublinear-time algorithms for tournament graphs ⋮ Breaking the ε-Soundness Bound of the Linearity Test over GF(2) ⋮ Every minor-closed property of sparse graphs is testable ⋮ Testing the expansion of a graph ⋮ Borel oracles. An analytical approach to constant-time algorithms ⋮ Testing Monotone Continuous Distributions on High-Dimensional Real Cubes ⋮ Sublinear time algorithms in the theory of groups and semigroups. ⋮ Recognizing the tractability in big data computing ⋮ Two Party Distribution Testing: Communication and Security ⋮ Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling ⋮ Solving variational inequalities with Stochastic Mirror-Prox algorithm