983 search results - page 24 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
VLSID
2001
IEEE
14 years 8 months ago
2001
IEEE
This paper presents novel techniques for the cycle-accurate power macro-modeling of complex RTL components. The proposed techniques are based on the observation that RTL component...
DAM
2008
13 years 7 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
AI
1999
Springer
13 years 7 months ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
CANS
2009
Springer
14 years 2 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...