scientific article; zbMATH DE number 1833420
From MaRDI portal
Publication:4780801
zbMath0998.68224MaRDI QIDQ4780801
Dana Ron, Alex Samorodnitsky, Michal Parnas
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290273
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Boolean functions (06E30)
Related Items (5)
A lower bound for testing juntas ⋮ Distribution-free connectivity testing for sparse graphs ⋮ \(\omega\)-regular languages are testable with a constant number of queries ⋮ Attribute estimation and testing quasi-symmetry ⋮ A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
This page was built for publication:
