4255 search results - page 156 / 851 » On Learning Boolean Functions |
77
Voted
FSE
2005
Springer
15 years 3 months ago
2005
Springer
For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-b...
ISMIS
2005
Springer
15 years 3 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
105
click to vote
CASC
2009
Springer
14 years 11 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...