scientific article
From MaRDI portal
Publication:3002788
DOI10.4086/toc.2007.v003a011zbMath1213.68332OpenAlexW2107740972MaRDI QIDQ3002788
Avi Wigderson, Johan T. Håstad
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Certifying equality with limited interaction ⋮ Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond ⋮ Distributed Testing of Distance-k Colorings ⋮ Unnamed Item ⋮ Communication and information complexity ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Lower Bounds for Testing Computability by Small Width OBDDs ⋮ Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems ⋮ Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond ⋮ Property testing lower bounds via a generalization of randomized parity decision trees ⋮ Property testing lower bounds via communication complexity ⋮ Best-order streaming model ⋮ Superfast coloring in CONGEST via efficient color sampling ⋮ Superfast coloring in CONGEST via efficient color sampling ⋮ Equality alone does not simulate randomness ⋮ Fooling Pairs in Randomized Communication Complexity ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing
This page was built for publication:
