Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010): Difference between revisions

@@ Property / arXiv ID @@
+.2572
@@ Property / arXiv ID: 1001.2572 / rank @@
+Normal rank
@@ Property / cites work @@
+Procedural languages for database queries and updates
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Choiceless polynomial time
@@ Property / cites work: Choiceless polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial time computation over unordered structures
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+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 @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Quantifiers and Logical Reducibilities
+Normal rank
@@ Property / cites work @@
+A restricted second order logic for finite structures
+Normal rank
@@ Property / cites work @@
+The expressive power of finitely many generalized quantifiers
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298571
@@ Property / cites work: Q4298571 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new high dimensional Weisfeiler-Lehman algorithm
+Normal rank
@@ Property / cites work @@
+On highly closed cellular algebras and highly closed isomorphisms
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of fixpoint logic with a symmetry-based choice construct
+Normal rank
@@ Property / cites work @@
+Finite model theory and its applications.
@@ Property / cites work: Finite model theory and its applications. / rank @@
+Normal rank
@@ Property / cites work @@
+On logics with two variables
@@ Property / cites work: On logics with two variables / rank @@
+Normal rank
@@ Property / cites work @@
+Q4936131
@@ Property / cites work: Q4936131 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-point definability and polynomial time on graphs with excluded minors
+Normal rank
@@ Property / cites work @@
+Testing Graph Isomorphism in Parallel by Playing a Game
+Normal rank
@@ Property / cites work @@
+Sequential abstract-state machines capture sequential algorithms
+Normal rank
@@ Property / cites work @@
+Fixed-point extensions of first-order logic
@@ Property / cites work: Fixed-point extensions of first-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+Definability hierarchies of generalized quantifiers
+Normal rank
@@ Property / cites work @@
+Almost Everywhere Equivalence of Logics in Finite Model Theory
+Normal rank
@@ Property / cites work @@
+Q4148000
@@ Property / cites work: Q4148000 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3875946
@@ Property / cites work: Q3875946 / rank @@
+Normal rank
@@ Property / cites work @@
+Relational queries computable in polynomial time
@@ Property / cites work: Relational queries computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+From Invariants to Canonization in Parallel
@@ Property / cites work: From Invariants to Canonization in Parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Expressive equivalence of least and inflationary fixed-point logic
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4332930
@@ Property / cites work: Q4332930 / rank @@
+Normal rank
@@ Property / cites work @@
+Canonization for two variables and puzzles on the square
+Normal rank
@@ Property / cites work @@
+Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
+Normal rank