71 search results - page 4 / 15 » Approximating Boolean Functions by OBDDs |
167
Voted
TCS
2002
15 years 6 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. ...
150
Voted
COCO
2003
Springer
15 years 11 months 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 ...
162
click to vote
CEC
2005
IEEE
16 years 3 hour 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...
151
Voted
FSE
2007
Springer
16 years 16 days 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...
153
Voted
FMCAD
2006
Springer
15 years 10 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 ...