✦ LIBER ✦

A polynomial-time perfect sampler for theQ-Ising with

✍ Scribed by Masaki Yamamoto; Shuji Kijima; Yasuko Matsui

Book ID: 106407357
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 571 KB
Volume: 22
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9309-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time approximate or perfect s

Polynomial time approximate or perfect samplers for discretized Dirichlet distribution

✍ Tomomi Matsui; Mitsuo Motoki; Naoyuki Kamatani; Shuji Kijima 📂 Article 📅 2010 🏛 Japan Society for Industrial and Applied Mathemati 🌐 English ⚖ 539 KB

A Polynomial-Time Algorithm for Near-Per

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

✍ Fernández-Baca, David; Lagergren, Jens 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 178 KB

A polynomial time generator for minimal

A polynomial time generator for minimal perfect hash functions

✍ Sager, Thomas J. 📂 Article 📅 1985 🏛 Association for Computing Machinery 🌐 English ⚖ 971 KB

A polynomial time algorithm for producti

A polynomial time algorithm for production planning with bounded inventory

✍ X. Liu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB

A polynomial-time algorithm for knapsack

A polynomial-time algorithm for knapsack with divisible item sizes

✍ W.F.J. Verhaegh; E.H.L. Aarts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 369 KB

A polynomial-time algorithm for a flow-s

A polynomial-time algorithm for a flow-shop batching problem with

✍ Peter Brucker; Natalia V. Shakhlevich 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 691 KB