✦ LIBER ✦

A Complexity Dichotomy For Hypergraph Partition Functions

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

Book ID: 105768124
Publisher: Springer
Year: 2010
Tongue: English
Weight: 609 KB
Volume: 19
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-010-0300-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast hypergraph min-cut algorithm for

A fast hypergraph min-cut algorithm for circuit partitioning

✍ Wai-Kei Mak; D.F. Wong 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between di!erent components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut pro

A sufficient condition for planar partit

A sufficient condition for planar partition functions

✍ Burkard Polster 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 575 KB

On Complex Zeros of theq-Potts Partition

On Complex Zeros of theq-Potts Partition Function for

✍ J.-M. Billiot; F. Corset; E. Fontenas 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 353 KB

Cohomological partition functions for a

Cohomological partition functions for a class of bosonic theories

✍ Antti J. Niemi; O. Tirkkonen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Complexity of computable functions for a

Complexity of computable functions for a generalized storage measure

✍ V. L. Matrosov 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 323 KB

Approximate partition functions for a si

Approximate partition functions for a singular potential at low temperatures

✍ A.R. Plastino; H.G. Miller 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 365 KB