1696 search results - page 2 / 340 » Permuted function matching |
DM
1999
13 years 5 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
DAC
1994
ACM
13 years 9 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...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
DAC
2005
ACM
14 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...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...