✦ LIBER ✦

Algorithmic recognition of identities in one class of finitely defined semigroups

✍ Scribed by L. M. Shneerson

Publisher: SP MAIK Nauka/Interperiodica
Year: 1990
Tongue: English
Weight: 394 KB
Volume: 48
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01164275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identities in Finitely Generated Semigro

Identities in Finitely Generated Semigroups of Polynomial Growth

✍ L.M. Shneerson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Isomorphic embeddability of semigroups w

Isomorphic embeddability of semigroups with countable sets of defining relations in finitely defined semigroups

✍ V. L. Murskii 📂 Article 📅 1967 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 357 KB

Algorithm of decomposition in finite sym

Algorithm of decomposition in finite symmetric semigroups

✍ V. G. Bondarev 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 345 KB

Independent domination in finitely defin

Independent domination in finitely defined classes of graphs

✍ R. Boliac; V. Lozin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

We study the independent dominating set problem restricted to graph classes deÿned by ÿnitely many forbidden induced subgraphs. The main result is two su cient conditions for the problem to be NP-hard in a ÿnitely deÿned class of graphs. We conjecture that those conditions are also necessary and des

Selection of the optimal algorithm in a

Selection of the optimal algorithm in a class of recognition algorithms

✍ T.L. Slutskaya 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 732 KB

Problem of selecting a recognition algor

Problem of selecting a recognition algorithm in a class of voting algorithms

✍ A. B. Doktorovich 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 416 KB