scientific article
From MaRDI portal
Publication:3549724
zbMath1231.68290MaRDI QIDQ3549724
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (39)
Universal points in the asymptotic spectrum of tensors ⋮ Testing list \(H\)-homomorphisms ⋮ Local Testing of Lattices ⋮ An Algebraic Characterization of Testable Boolean CSPs ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Testing Linear-Invariant Properties ⋮ Unnamed Item ⋮ Lifted projective Reed-Solomon codes ⋮ Local-vs-global combinatorics ⋮ Nowhere to go but high: a perspective on high-dimensional expanders ⋮ 2-transitivity is insufficient for local testability ⋮ Unnamed Item ⋮ On bases of BCH codes with designed distance 3 and their extensions ⋮ Testing Euclidean Spanners ⋮ Sample-Based High-Dimensional Convexity Testing. ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Non-interactive proofs of proximity ⋮ Symmetric LDPC codes and local testing ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Sparse affine-invariant linear codes are locally testable ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ Invariance in Property Testing ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Optimal Testing of Reed-Muller Codes ⋮ Symmetric LDPC Codes and Local Testing ⋮ Proximity Oblivious Testing and the Role of Invariances ⋮ Proximity Oblivious Testing and the Role of Invariances ⋮ On Sums of Locally Testable Affine Invariant Properties ⋮ Limits on the Rate of Locally Testable Affine-Invariant Codes ⋮ On the Average-Case Complexity of Property Testing ⋮ A combinatorial characterization of smooth LTCs and applications ⋮ From Local to Robust Testing via Agreement Testing ⋮ Testing properties of functions on finite groups ⋮ Characterizations of locally testable linear- and affine-invariant families ⋮ A characterization of constant‐sample testable properties ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ Partially Symmetric Functions Are Efficiently Isomorphism Testable ⋮ Unnamed Item ⋮ Lower bounds for testing triangle-freeness in Boolean functions
This page was built for publication:
