983 search results - page 23 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
ECCC
2010
13 years 6 months ago
2010
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...
JUCS
2006
13 years 7 months ago
2006
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...
TIT
2008
13 years 7 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...