1278 search results - page 7 / 256 » The Complexity of Weighted Boolean |
ISMVL
2002
IEEE
14 years 14 days ago
2002
IEEE
A generalization of McMillan’s conjunctive expansion of Boolean functions [1] to the case of multiple-valued input binary-valued output functions is presented. It is based on th...
AB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A network of reactions is a commonly used paradigm for representing knowledge about a biological process. How does one understand such generic networks and answer queries...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
DLT
2009
13 years 5 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...