✦ LIBER ✦

The complexity of approximately counting stable matchings

✍ Scribed by Prasad Chebolu; Leslie Ann Goldberg; Russell Martin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of approximately counting

✍ Prasad Chebolu; Leslie Ann Goldberg; Russell Martin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 358 KB

The Relative Complexity of Approximate C

✍ Martin Dyer; Leslie Ann Goldberg; Catherine Greenhill; Mark Jerrum 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 295 KB

The Complexity of Counting Problems in E

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 KB

The dynamics of stable matchings and hal

✍ Péter Biró; Katarína Cechlárová; Tamás Fleiner 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

The complexity of counting homeomorphs

✍ Graham Farr; Colin McDiarmid 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 202 KB

On the Distributed Complexity of Computi

✍ Hanckowiak, Michal; Karonski, Michal; Panconesi, Alessandro 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 204 KB