On Arbitrarily Traceable Graphs.
Gabriel Dirac (1972)
Mathematica Scandinavica
Similarity:
Gabriel Dirac (1972)
Mathematica Scandinavica
Similarity:
Ivan Tafteberg Jakobsen (1972)
Mathematica Scandinavica
Similarity:
F. Harary, G. Exoo, J. Kabell (1981)
Mathematica Scandinavica
Similarity:
Ivan Tafteberg Jakobsen (1983)
Mathematica Scandinavica
Similarity:
G.A. Dirac (1963)
Mathematica Scandinavica
Similarity:
Tudor Zamfirescu (1976)
Mathematica Scandinavica
Similarity:
WILLIAM HANF (1957)
Mathematica Scandinavica
Similarity:
Torleiv Klove (1973)
Mathematica Scandinavica
Similarity:
Philip Olin (1976)
Mathematica Scandinavica
Similarity:
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2010)
RAIRO - Theoretical Informatics and 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).
Lars Dovling Andersen (1977)
Mathematica Scandinavica
Similarity:
J.R. Isbell (1965)
Mathematica Scandinavica
Similarity:
J. Mykkeltveit, Ernst S. Selmer (1973)
Mathematica Scandinavica
Similarity: