On the hardness of sampling independent sets beyond the tree threshold (Q1017883): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Nicholas C. Wormald / rank | |||
Property / author | |||
Property / author: Nicholas C. Wormald / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2048759201 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0701471 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The ?(2) limit in the random assignment problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Glauber dynamics on trees and hyperbolic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A second threshold for the hard‐core model on a Bethe lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Counting Independent Sets in Sparse Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Markov Chains for Independent Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4519896 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3721805 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4527036 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542543 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4237477 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344223 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gibbs rapidly samples colorings of \(G(n, d/n)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Design of capacity-approaching irregular low-density parity-check codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135094 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Parisi formula / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the Glauber dynamics for sampling independent sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting independent sets up to the tree threshold / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263664 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:22, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the hardness of sampling independent sets beyond the tree threshold |
scientific article |
Statements
On the hardness of sampling independent sets beyond the tree threshold (English)
0 references
13 May 2009
0 references