Sciweavers

44 search results - page 1 / 9
» Lower Bounds for Testing Function Isomorphism
Sort
View
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
13 years 9 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
ECCC
2010
117views more  ECCC 2010»
13 years 4 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
13 years 11 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 2 months ago
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
Arnab Bhattacharyya, Ning Xie
MFCS
2007
Springer
13 years 11 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner