74 search results - page 5 / 15 » A Canonical Form for Testing Boolean Function Properties |
ECCC
2011
14 years 4 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
VLSID
1996
IEEE
15 years 1 months ago
1996
IEEE
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
ECCC
2008
14 years 9 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...