On Boolean partial differential equations
On cubes and dichotomic trees
On free Boolean vectors.
On maximal QROBDD’s of boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On maximal QROBDD's of Boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On networks of non-deterministic automata
On nonlinear complexity of monotone realization of a family of Boolean sums.
On positive, linear and quadratic Boolean functions
On set-valued non-Boolean functions.
On the analytic form of the discrete Kramer sampling theorem.
On the complexity of the hidden weighted bit function for various BDD models
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
Ordered binary decision diagrams (OBDDs) and several more general BDD models have turned out to be representations of Boolean functions which are useful in applications like verification, timing analysis, test pattern generation or combinatorial optimization. The hidden weighted bit function (HWB) is of particular interest, since it seems to be the simplest function with exponential OBDD size. The complexity of this function with respect to different circuit models, formulas, and various...
On the number of monotonic functions from two-valued logic to -valued logic
On the positive and the inversion complexity of Boolean functions
On the regular Sturm-Liouville transform.