Complexity versus stability for classes of propositional formulas (Q293437): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+D15
@@ Property / Mathematics Subject Classification ID: 03D15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B05
@@ Property / Mathematics Subject Classification ID: 03B05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590788
@@ Property / zbMATH DE Number: 6590788 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+coNP-completeness
@@ Property / zbMATH Keywords: coNP-completeness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+equivalence of formulas
@@ Property / zbMATH Keywords: equivalence of formulas / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Horn formulas
@@ Property / zbMATH Keywords: Horn formulas / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+CNF formulas
@@ Property / zbMATH Keywords: 2CNF formulas / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+XOR-CNF formulas
@@ Property / zbMATH Keywords: XOR-CNF formulas / rank @@
+Normal rank

Revision as of 21:18, 27 June 2023