Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q396628 |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Marek Karpinski / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4236981399 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0501081 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2701738 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new multilayered PCP and the hardness of hypergraph vertex cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4218130 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4798347 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768313 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colouring graphs when the number of colours is nearly the maximum degree / rank | |||
Normal rank |
Latest revision as of 11:23, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Path coupling using stopping times and counting independent sets and colorings in hypergraphs |
scientific article |
Statements
Path coupling using stopping times and counting independent sets and colorings in hypergraphs (English)
0 references
5 June 2008
0 references
path coupling
0 references
Markov chain Monte Carlo
0 references
hypergraph coloring
0 references
hypergraph independent set
0 references