Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609): Difference between revisions

@@ Property / describes a project that uses @@
+OEIS
@@ Property / describes a project that uses: OEIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4236981399
@@ Property / OpenAlex ID: W4236981399 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+math/0501081
@@ Property / arXiv ID: math/0501081 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2701738
@@ Property / cites work: Q2701738 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501802
@@ Property / cites work: Q5501802 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new multilayered PCP and the hardness of hypergraph vertex cover
+Normal rank
@@ Property / cites work @@
+Q5501247
@@ Property / cites work: Q5501247 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218130
@@ Property / cites work: Q4218130 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768313
@@ Property / cites work: Q2768313 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring graphs when the number of colours is nearly the maximum degree
+Normal rank