✦ LIBER ✦

The Relative Complexity of Approximate Counting Problems

✍ Scribed by Martin Dyer; Leslie Ann Goldberg; Catherine Greenhill; Mark Jerrum

Book ID: 106148524
Publisher: Springer
Year: 2003
Tongue: English
Weight: 295 KB
Volume: 38
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-003-1073-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Planar Counting Proble

The Complexity of Planar Counting Problems

✍ Hunt, Harry B.; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 436 KB

The Parameterized Complexity of Counting

The Parameterized Complexity of Counting Problems

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

Complexity of Generalized Satisfiability

Complexity of Generalized Satisfiability Counting Problems

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

The Complexity of Counting Problems in E

The Complexity of Counting Problems in Equational Matching

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

Rational transductions and complexity of

Rational transductions and complexity of counting problems

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

The Relative Complexity of NP Search Pro

The Relative Complexity of NP Search Problems

✍ Paul Beame; Stephen Cook; Jeff Edmonds; Russell Impagliazzo; Toniann Pitassi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Papadimitriou introduced several classes of NP search problems based on combinatorial principles which guarantee the existence of solutions to the problems. Many interesting search problems not known to be solvable in polynomial time are contained in these classes, and a number of them are complete