Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761): Difference between revisions

@@ Property / arXiv ID @@
+.2747
@@ Property / arXiv ID: 1212.2747 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2958513
@@ Property / cites work: Q2958513 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+Structure and complexity of relational queries
@@ Property / cites work: Structure and complexity of relational queries / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized best-first search strategies and the optimality of A*
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence in finite-variable logics is complete for polynomial time
+Normal rank
@@ Property / cites work @@
+Number of quantifiers is better than number of tape cells
+Normal rank
@@ Property / cites work @@
+Succinct definitions in the first order theory of graphs
+Normal rank
@@ Property / cites work @@
+Logical complexity of graphs: a survey
@@ Property / cites work: Logical complexity of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel consistent labeling algorithms
@@ Property / cites work: Parallel consistent labeling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
+Normal rank