74 search results - page 1 / 15 » A Canonical Form for Testing Boolean Function Properties |
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
DAC
2005
ACM
14 years 5 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...
DAC
1994
ACM
13 years 8 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
TCAD
2002
13 years 4 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...