✦ LIBER ✦

Parameterized computational complexity of Dodgson and Young elections

✍ Scribed by Nadja Betzler; Jiong Guo; Rolf Niedermeier

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximability of Dodgson and Yo

✍ Ioannis Caragiannis; Jason A. Covey; Michal Feldman; Christopher M. Homan; Chris 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Parameterized computational complexity o

✍ Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 231 KB

Parameterized complexity and inapproxima

✍ Chunmei Liu; Yinglei Song 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 501 KB

Exact Complexity of the Winner Problem f

✍ Rothe; Spakowski; Vogel 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 212 KB

The Parameterized Complexity of Counting

✍ Flum, Jörg; Grohe, Martin 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

On the parameterized complexity of short

✍ Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 169 KB