123 search results - page 10 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
ACSD
2010
IEEE
13 years 5 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
DAM
1999
13 years 7 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
ESORICS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
STOC
2007
ACM
14 years 7 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...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...