A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360): Difference between revisions

@@ Property / OpenAlex ID @@
+W3012165975
@@ Property / OpenAlex ID: W3012165975 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114167077
@@ Property / Wikidata QID: Q114167077 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching Is as Easy as the Decision Problem, in the NC Model
+Normal rank
@@ Property / cites work @@
+Rings of sets
@@ Property / cites work: Rings of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite perfect matching as a real polynomial
@@ Property / cites work: Bipartite perfect matching as a real polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867143
@@ Property / cites work: Q4867143 / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite perfect matching is in quasi-NC
@@ Property / cites work: Bipartite perfect matching is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Boolean Functions
@@ Property / cites work: Analysis of Boolean Functions / rank @@
+Normal rank
@@ Property / cites work @@
+The On-Line Encyclopedia of Integer Sequences
@@ Property / cites work: The On-Line Encyclopedia of Integer Sequences / rank @@
+Normal rank