Hard Enumeration Problems in Geometry and Combinatorics (Q3730017): Difference between revisions

@@ Property / Wikidata QID @@
+Q56504779
@@ Property / Wikidata QID: Q56504779 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2000930415
@@ Property / OpenAlex ID: W2000930415 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Distinct Representatives
@@ Property / cites work: An Algorithm for Distinct Representatives / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The Information-Theoretic Bound is Good for Merging
+Normal rank
@@ Property / cites work @@
+Acyclic orientations of graphs
@@ Property / cites work: Acyclic orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Two combinatorial applications of the Aleksandrov-Fenchel inequalities
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3730017