✦ LIBER ✦

NP-completeness in hedonic games

✍ Scribed by Coralio Ballester

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of some problems concern

✍ K. Prasad; J. S. Kelly 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

Contractibility and NP-completeness

✍ A. E. Brouwer; H. J. Veldman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

Farsighted stability in hedonic games

✍ Effrosyni Diamantoudi; Licun Xue 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 336 KB

On NP-completeness in Linear Logic

✍ Alexey P. Kopylov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB

On the NP-completeness of finding an opt

✍ Francis Chu; Joseph Halpern 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 92 KB

NP-completeness and APX-completeness of

✍ Lei Chen; Weiming Zeng; Changhong Lu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 299 KB