983 search results - page 34 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
ICCD
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
IOLTS
2009
IEEE
14 years 2 months ago
2009
IEEE
—Robust circuit design has become a major concern for nanoscale technologies. As a consequence, for design validation, not only the functionality of a circuit has to be considere...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
ALT
2010
Springer
13 years 8 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...