✦ LIBER ✦

Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics

✍ Scribed by L. A. Sholomov

Publisher: Springer US
Year: 1984
Tongue: English
Weight: 528 KB
Volume: 20
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the composition representa

Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters

✍ L. A. Sholomov 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 624 KB

On asymptotic estimates of the complexit

On asymptotic estimates of the complexity of certain classes of contact circuits

✍ A. D. Korshunov 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 764 KB

Representation of characteristic functio

Representation of characteristic function games by social choice functions

✍ S. Ishikawa; K. Nakamura 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 370 KB

Asymptotic properties of nonparametric e

Asymptotic properties of nonparametric estimators of the characteristic function

✍ Yu. A. Koshevnik 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 751 KB

Compositional complexity of Boolean func

Compositional complexity of Boolean functions

✍ Harold Abelson; Andrzej Ehrenfeucht; James Fickett; Jan Mycielski 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Complexity of Representations of Quantis

Complexity of Representations of Quantised Function Algebras and Representation Type

✍ Iain Gordon 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Ž q . w x B be opposite Borel subgroups of G, and ᑿ s Lie B . Let O G be the ⑀ quantised function algebra at a root of unity ⑀ and let U G 0 be the quantised ⑀ enveloping algebra of ᑿ at a root of unity. We study the finite dimensional factor w xŽ . G 0 Ž . y algebras O G g and U b for g g G and b g