Pages that link to "Item:Q2839173"
From MaRDI portal
The following pages link to Sherali-Adams relaxations and indistinguishability in counting logics (Q2839173):
Displaying 22 items.
- Relational linear programming (Q511779) (← links)
- Fractional isomorphism of graphs (Q1336666) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- (Q5090449) (← links)
- (Q5091117) (← links)
- (Q5091274) (← links)
- (Q5091279) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- On the Weisfeiler-Leman dimension of permutation graphs (Q6561325) (← links)
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability (Q6601300) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
