983 search results - page 9 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
115
click to vote
CIE
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
127
Voted
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
103
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
115
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...