Sciweavers

706 search results - page 22 / 142
» On a quasi-ordering on Boolean functions
Sort
View
ECCC
2010
87views more  ECCC 2010»
13 years 6 months ago
On the degree of symmetric functions on the Boolean cube
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
Gil Cohen, Amir Shpilka
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
14 years 14 hour ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 7 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau
VLSID
1996
IEEE
135views VLSI» more  VLSID 1996»
13 years 11 months ago
Cubical CAMP for minimization of Boolean functions
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
Nripendra N. Biswas, C. Srikanth, James Jacob
EUROGP
2001
Springer
14 years 5 days ago
Neutrality and the Evolvability of Boolean Function Landscape
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding sche...
Tina Yu, Julian F. Miller