21 search results - page 2 / 5 » On the Sensitivity of Cyclically-Invariant Boolean Functions |
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
SAS
2004
Springer
13 years 10 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
ISCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...