K-class assignments
Charles S. Tapiero (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Charles S. Tapiero (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Johannes Köbler, Uwe Schöning, Klaus W. Wagner (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Rossella Petreschi, Bruno Simeone (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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).
I. G. Rosenberg (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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...
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
André Arnold (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: