1696 search results - page 1 / 340 » Permuted function matching |
IPL
2010
13 years 9 months ago
2010
ASPDAC
1999
ACM
14 years 3 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
JCT
2000
13 years 10 months ago
2000
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
ICCAD
2010
IEEE
13 years 8 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...