Publication:5491026
From MaRDI portal
zbMath1100.68041MaRDI QIDQ5491026
Publication date: 26 September 2006
68Q25: Analysis of algorithms and problem complexity
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Testing Monotone Continuous Distributions on High-Dimensional Real Cubes, Solving variational inequalities with Stochastic Mirror-Prox algorithm, 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, Sublinear time algorithms in the theory of groups and semigroups., Every minor-closed property of sparse graphs is testable, Testing the expansion of a graph, Breaking the ε-Soundness Bound of the Linearity Test over GF(2), Borel oracles. An analytical approach to constant-time algorithms