Sciweavers

290 search results - page 11 / 58
» Lattice-based computation of Boolean functions
Sort
View
97
Voted
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
15 years 3 months ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich
81
Voted
FOCS
2010
IEEE
14 years 9 months ago
Bounded Independence Fools Degree-2 Threshold Functions
For an n-variate degree
Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson
92
Voted
FOCS
1994
IEEE
15 years 3 months ago
On Rank vs. Communication Complexity
This paper concerns the open problem of Lov
Noam Nisan, Avi Wigderson
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 1 days ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
71
Voted
FCT
2001
Springer
15 years 4 months ago
Dense Families and Key Functions of Database Relation Instances
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...
Jouni Järvinen