Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763): Difference between revisions

@@ Property / cites work @@
+Q4075450
@@ Property / cites work: Q4075450 / rank @@
+Normal rank
@@ Property / cites work @@
+Model theory
@@ Property / cites work: Model theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5812175
@@ Property / cites work: Q5812175 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical definability of NP optimization problems
@@ Property / cites work: Logical definability of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+-1 laws and decision problems for fragments of second-order logic
+Normal rank
@@ Property / cites work @@
+Descriptive characterizations of computational complexity
+Normal rank
@@ Property / cites work @@
+Q4286756
@@ Property / cites work: Q4286756 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifiers and approximation
@@ Property / cites work: Quantifiers and approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Comparing the Expressibility of Languages Formed Using NP-Complete Operators
+Normal rank
@@ Property / cites work @@
+Q4342090
@@ Property / cites work: Q4342090 / rank @@
+Normal rank