✦ LIBER ✦

Algorithmic problems of nontransitive (SSB) utilities

✍ Scribed by O.M. Kosheleva; V.Ya. Kreinovich

Book ID: 104177691
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 553 KB
Volume: 21
Category: Article
ISSN: 0165-4896
DOI: 10.1016/0165-4896(91)90042-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Structure of SSB utilities for decis

The Structure of SSB utilities for decision under uncertainty

✍ P.C. Fishburn; I.H. LaValle 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 699 KB

Linear Aggregation of SSB Utility Functi

Linear Aggregation of SSB Utility Functionals

✍ Arja H. Turunen-Red; John A. Weymark 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 83 KB

Algorithmic Solutions of Queueing Proble

Algorithmic Solutions of Queueing Problems

✍ Marcel F. Neuts 📂 Article 📅 1975 🏛 Applied Probability Trust 🌐 English ⚖ 245 KB

Algorithmic complexity of proper labelin

Algorithmic complexity of proper labeling problems

✍ Dehghan, Ali; Sadeghi, Mohammad-Reza; Ahadi, Arash 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Algorithmic Solution of Extremal Digraph

Algorithmic Solution of Extremal Digraph Problems

✍ W. G. Brown, P. Erdös and M. Simonovits 📂 Article 📅 1985 🏛 American Mathematical Society 🌐 English ⚖ 677 KB

Algorithmic Problems for Amalgams of Fin

Algorithmic Problems for Amalgams of Finite Semigroups

✍ Mark V. Sapir 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We prove that there exists an amalgam of two finite 4-nilpotent semigroups such that the corresponding amalgamated product has an undecidable word problem. We also show that the problem of embeddability of finite semigroup amalgams in any semigroups and the problem of embeddability of finite semigro