On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893): Difference between revisions

@@ Property / cites work @@
+Counting classes: Thresholds, parity, mods, and fewness
+Normal rank
@@ Property / cites work @@
+On the acceptance power of regular languages
@@ Property / cites work: On the acceptance power of regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform approach to define complexity classes
@@ Property / cites work: A uniform approach to define complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy I: Structural Properties
@@ Property / cites work: The Boolean Hierarchy I: Structural Properties / rank @@
+Normal rank
@@ Property / cites work @@
+On unique satisfiability and the threshold behavior of randomized reductions
+Normal rank
@@ Property / cites work @@
+Polynomial closure and unambiguous product
@@ Property / cites work: Polynomial closure and unambiguous product / rank @@
+Normal rank
@@ Property / cites work @@
+Q4302435
@@ Property / cites work: Q4302435 / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying regular events in symbolic logic
@@ Property / cites work: Classifying regular events in symbolic logic / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank