On active and passive testing

Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" from satisfying it? This is a fundamental question in Property Testing, where traditionally the testing algorith...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2015-11
Hauptverfasser:	Noga Alon, Hod, Rani, Weinstein, Amit
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Boolean algebra Boolean functions Combinatorial analysis Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Linear functions Mathematics - Combinatorics Polynomials Queries Set theory Statistical analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!