Sciweavers

71 search results - page 3 / 15
» Testing Boolean Function Isomorphism
Sort
View
MFCS
2005
Springer
15 years 3 months ago
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
15 years 3 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
ICALP
2009
Springer
15 years 10 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
MPC
2004
Springer
115views Mathematics» more  MPC 2004»
15 years 3 months ago
A Free Construction of Kleene Algebras with Tests
In this paper we define Kleene algebra with tests in a slightly more general way than Kozen’s definition. Then we give an explicit construction of the free Kleene algebra with...
Hitoshi Furusawa