Free Access
RAIRO. Inform. théor.
Volume 11, Number 2, 1977
Page(s) 157 - 174
Published online 01 February 2017
  1. 1. C. BERGE, Théorie des graphes et ses applications, Dunod, Paris, 1958. [MR: 102822] [Zbl: 0088.15404] [Google Scholar]
  2. 2. R. M. KARP, Reducibility among combinatorial problems, Technical Report n° 3, April 1972, Department of Computer Science, University of California, Berkeley. [Zbl: 0366.68041] [MR: 378476] [Google Scholar]
  3. 3. V. V. GLAGOLEV, Some estimations of disjunctive normal forms of boolean functions. Problems of Cybernetics, v. 19, Moscow, 1967, p. 75-94 (in Russian). [MR: 225634] [Zbl: 0251.94035] [Google Scholar]
  4. 4. PHAN DINH DIÊU, On the complexity of the problem of state minimization for incompletely specified sequential automata. Elektronische Informations verarbeitung und Kybernetik, 11, 1975, p. 3-17. [MR: 414262] [Zbl: 0306.94038] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.