706 search results - page 37 / 142 » On a quasi-ordering on Boolean functions |
ASPDAC
2007
ACM
13 years 11 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 ...
FCT
2001
Springer
14 years 6 days ago
2001
Springer
In this paper dense families of database relations are introduced. We characterize dependencies and keys of relation instances in terms of dense families. Key functions are also in...
VLSI
2007
Springer
14 years 1 months ago
2007
Springer
— This paper discusses reduction of the number of product terms in representation of totally symmetric Boolean functions by Sum of Products (SOP) and Fixed Polarity ReedMuller (F...
DM
2010
13 years 7 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
CRYPTO
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...