✦ LIBER ✦

The Complexity of Planar Counting Problems

✍ Scribed by Hunt, Harry B.; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Parameterized Complexity of Counting

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

The Relative Complexity of Approximate C

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

Complexity of Generalized Satisfiability

✍ Nadia Creignou; Miki Hermann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 698 KB

The Complexity of Counting Problems in E

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

Rational transductions and complexity of

✍ C. Choffrut; M. Goldwurm 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 829 KB

The Complexity of Counting in Sparse, Re

✍ Vadhan, Salil P. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 326 KB