Q4625692 (Q4625692): Difference between revisions

@@ Property / cites work @@
+On symmetric circuits and fixed-point logics
@@ Property / cites work: On symmetric circuits and fixed-point logics / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient conditions for unsatisfiability of random formulas
+Normal rank
@@ Property / cites work @@
+Affine systems of equations and counting infinitary logic
+Normal rank
@@ Property / cites work @@
+A combinatorial characterization of resolution width
+Normal rank
@@ Property / cites work @@
+Sherali-Adams relaxations and indistinguishability in counting logics
+Normal rank
@@ Property / cites work @@
+Proof Complexity Meets Algebra
@@ Property / cites work: Proof Complexity Meets Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Problems Solvable by Local Consistency Methods
+Normal rank
@@ Property / cites work @@
+Q4790380
@@ Property / cites work: Q4790380 / rank @@
+Normal rank
@@ Property / cites work @@
+Limitations of Algebraic Approaches to Graph Isomorphism Testing
+Normal rank
@@ Property / cites work @@
+Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+Q4228469
@@ Property / cites work: Q4228469 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Q3775538
@@ Property / cites work: Q3775538 / rank @@
+Normal rank
@@ Property / cites work @@
+A Definability Dichotomy for Finite Valued CSPs
@@ Property / cites work: A Definability Dichotomy for Finite Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5144655
@@ Property / cites work: Q5144655 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Counting in Team Semantics
@@ Property / cites work: Counting in Team Semantics / rank @@
+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 @@
+Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
+Normal rank
@@ Property / cites work @@
+Q5111195
@@ Property / cites work: Q5111195 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank logic is dead, long live rank logic!
@@ Property / cites work: Rank logic is dead, long live rank logic! / rank @@
+Normal rank
@@ Property / cites work @@
+PEBBLE GAMES AND LINEAR EQUATIONS
@@ Property / cites work: PEBBLE GAMES AND LINEAR EQUATIONS / rank @@
+Normal rank
@@ Property / cites work @@
+Q5144627
@@ Property / cites work: Q5144627 / rank @@
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the polynomial calculus and the Gröbner basis algorithm
+Normal rank
@@ Property / cites work @@
+The expressive power of stratified logic programs
@@ Property / cites work: The expressive power of stratified logic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Sherali-Adams relaxations of graph isomorphism polytopes
+Normal rank
@@ Property / cites work @@
+The Complexity of Propositional Proofs
@@ Property / cites work: The Complexity of Propositional Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Resolution Complexity of Graph Non-isomorphism
+Normal rank