scientific article; zbMATH DE number 1241385
From MaRDI portal
Publication:4224925
zbMath0912.68071MaRDI QIDQ4224925
Publication date: 17 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Algebraic testing and weight distributions of codes. ⋮ Additive approximation for edge-deletion problems ⋮ Recognizing Coverage Functions ⋮ Approximate membership for regular languages modulo the edit distance ⋮ A local decision test for sparse polynomials ⋮ Unnamed Item ⋮ Property testing on \(k\)-vertex-connectivity of graphs ⋮ Approximately classic judgement aggregation ⋮ A property tester for tree-likeness of quartet topologies ⋮ Testing consistency of quartet topologies: a parameterized approach ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Estimating the Longest Increasing Sequence in Polylogarithmic Time ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Testing hypergraph colorability ⋮ Sublinear-time Algorithms ⋮ Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms ⋮ Sublinear DTD Validity ⋮ Separating Sublinear Time Computations by Approximate Diameter
This page was built for publication:
