scientific article; zbMATH DE number 6292744
From MaRDI portal
Publication:5414625
DOI10.4086/cjtcs.2013.006zbMath1286.68487arXiv1209.3849OpenAlexW4247893027MaRDI QIDQ5414625
David García-Soriano, Arie Matsliah, Harry Buhrman, Ronald de Wolf
Publication date: 7 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.3849
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)
An adaptivity hierarchy theorem for property testing ⋮ Amplification of One-Way Information Complexity via Codes and Noise Sensitivity ⋮ An optimal tester for \(k\)-linear ⋮ Certifying equality with limited interaction ⋮ Approximating the distance to monotonicity of Boolean functions ⋮ Unnamed Item ⋮ An optimal tester for \(k\)-Linear ⋮ Property testing lower bounds via a generalization of randomized parity decision trees ⋮ Unnamed Item ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint
This page was built for publication:
