71 search results - page 4 / 15 » Approximating Boolean Functions by OBDDs |
TCS
2002
13 years 7 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
COCO
2003
Springer
14 years 20 days ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...