983 search results - page 13 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
ICPR
2010
IEEE
14 years 18 hour ago
2010
IEEE
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
JC
2008
13 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
DNA
2009
Springer
14 years 2 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
CC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...