scientific article
From MaRDI portal
Publication:3152421
zbMath1024.68045MaRDI QIDQ3152421
Publication date: 23 October 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Testing metric properties, Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata, Big Data on the Rise?, Lower bounds for testing Euclidean minimum spanning trees, Separating sublinear time computations by approximate diameter, Additive approximation for edge-deletion problems, Information theory in property testing and monotonicity testing in higher dimension, A query efficient non-adaptive long code test with perfect completeness, Finding cycles and trees in sublinear time, Testing juntas, On the benefits of adaptivity in property testing of dense graphs, Approximate membership for regular languages modulo the edit distance, Indistinguishability and First-Order Logic, A local decision test for sparse polynomials, Some results on approximate 1-median selection in metric spaces, Property testing on \(k\)-vertex-connectivity of graphs, Local and global price of anarchy of graphical games, Approximately classic judgement aggregation, Testable and untestable classes of first-order formulae, Efficiently testing sparse \(\text{GF}(2)\) polynomials, A property tester for tree-likeness of quartet topologies, Testing consistency of quartet topologies: a parameterized approach, On-line approximate string matching with bounded errors, Testing Eulerianity and connectivity in directed sparse graphs, Distribution-free connectivity testing for sparse graphs, Breaking the ε-Soundness Bound of the Linearity Test over GF(2), Is submodularity testable?, Property-preserving data reconstruction, The complexity of some topological inference problems, Testing of matrix-poset properties, Testing outerplanarity of bounded degree graphs, Boosting distinct random sampling for basic counting on the union of distributed streams, A separation theorem in property testing, Every minor-closed property of sparse graphs is testable, Testing the expansion of a graph, Estimating the Longest Increasing Sequence in Polylogarithmic Time, Testing convexity properties of tree colorings, Sublinear-time Algorithms, Property Testing of Massively Parametrized Problems – A Survey, Sublinear Algorithms in the External Memory Model, Testing (Subclasses of) Halfspaces, Local Property Reconstruction and Monotonicity, Tolerant property testing and distance approximation, Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms, Testing subgraphs in directed graphs, The Local and Global Price of Anarchy of Graphical Games, Contemplations on Testing Graph Properties, A unified framework for testing linear‐invariant properties, Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling, Testing computability by width-two OBDDs, Unnamed Item, A Polynomial Lower Bound for Testing Monotonicity, A large lower bound on the query complexity of a simple Boolean function, Separating Sublinear Time Computations by Approximate Diameter, Robust characterizations of k -wise independence over product spaces and related testing results, Testing Probability Distributions using Conditional Samples, On the structure of equilibria in basic network formation, Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata, Exponentially improved algorithms and lower bounds for testing signed majorities
