scientific article; zbMATH DE number 6783501
From MaRDI portal
Publication:5365148
zbMath1373.68257MaRDI QIDQ5365148
Sourav Chakraborty, Arie Matsliah, David García-Soriano
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133166
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Reducing Testing Affine Spaces to Testing Linearity of Functions ⋮ Local correction of juntas ⋮ Isomorphism testing of Boolean functions computable by constant-depth circuits ⋮ Property testing lower bounds via communication complexity ⋮ Partially Symmetric Functions Are Efficiently Isomorphism Testable ⋮ Local correction with constant error rate
This page was built for publication:
