✦ LIBER ✦

Exact Complexity of the Winner Problem for Young Elections

✍ Scribed by Rothe; Spakowski; Vogel

Publisher: Springer
Year: 2003
Tongue: English
Weight: 212 KB
Volume: 36
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-002-1093-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the Exact Domatic Number P

Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem

✍ Tobias Riege; Jörg Rothe 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 418 KB

Complexity evaluation of benchmark insta

Complexity evaluation of benchmark instances for the -median problem

✍ B. Goldengorin; D. Krushinsky 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 633 KB

The paper is aimed at experimental evaluation of the complexity of the p-Median problem instances, defined by m × n costs matrices, from several of the most widely used libraries. The complexity is considered in terms of possible problem size reduction and preprocessing, irrespective of the solution

Computational complexity of the integrat

Computational complexity of the integration problem for anisotropic classes

✍ Ye Peixin 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 322 KB

Complexity of the identity checking prob

Complexity of the identity checking problem for finite semigroups

✍ J. Almeida; M. V. Volkov; S. V. Goldberg 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 230 KB

A fixed-space program of linear output c

A fixed-space program of linear output complexity for the problem of the three vessels

✍ Martin Rem; Young-il Choo 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 518 KB

The complexity of the word problem for a

The complexity of the word problem for abelian l-groups

✍ Volker Weispfenning 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 365 KB