The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Product form parametric representation of the solutions to a quadratic boolean equation”

K-class assignments

Charles S. Tapiero (1972)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

On maximal QROBDD’s of boolean functions

Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

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).

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs

Henrik Brosenne, Matthias Homeister, Stephan Waack (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear...