scientific article; zbMATH DE number 6395191
From MaRDI portal
Publication:5497118
DOI10.4086/toc.2014.v010a017zbMath1319.68098OpenAlexW1786299627MaRDI QIDQ5497118
C. Seshadhri, Deeparnab Chakrabarty
Publication date: 3 February 2015
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2014.v010a017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (11)
Parameterized property testing of functions ⋮ Approximating the distance to monotonicity of Boolean functions ⋮ Unnamed Item ⋮ Erasure-Resilient Property Testing ⋮ Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces ⋮ Adaptive Lower Bound for Testing Monotonicity on the Line ⋮ Almost Optimal Distribution-Free Sample-Based Testing of k-Modality ⋮ Unnamed Item ⋮ A Polynomial Lower Bound for Testing Monotonicity ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ Unnamed Item
This page was built for publication:
