Revisiting the complexity of and/or graph solution (Q394337): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C78
@@ Property / Mathematics Subject Classification ID: 05C78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P05
@@ Property / Mathematics Subject Classification ID: 68P05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6250591
@@ Property / zbMATH DE Number: 6250591 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+and/or graphs
@@ Property / zbMATH Keywords: and/or graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fixed parameter tractability
@@ Property / zbMATH Keywords: fixed parameter tractability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-hardness
@@ Property / zbMATH Keywords: NP-hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+W[1]-hardness
@@ Property / zbMATH Keywords: W[1]-hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+W[2]-hardness
@@ Property / zbMATH Keywords: W[2]-hardness / rank @@
+Normal rank

Revision as of 15:54, 29 June 2023