Partially Symmetric Functions are Efficiently Isomorphism-Testable

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An important open question in property testing is to determine...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Blais, Eric, Weinstein, Amit, Yoshida, Yuichi
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!