An NP-complete matching problem (Q1166935): Difference between revisions

@@ Property / Wikidata QID @@
+Q106200605
@@ Property / Wikidata QID: Q106200605 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Some Matching Problems for Bipartite Graphs
@@ Property / cites work: Some Matching Problems for Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(80)90055-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2061934263
@@ Property / OpenAlex ID: W2061934263 / rank @@
+Normal rank