2 search results - page 1 / 1 » Efficient computation of canonical form for Boolean matching... |
102
Voted
ASPDAC
2004
ACM
15 years 11 months ago
2004
ACM
143
click to vote
DAC
2005
ACM
16 years 6 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...