The following pages link to PEBBLE GAMES AND LINEAR EQUATIONS (Q3450805):
Displaying 18 items.
- 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)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2839173) (← links)
- (Q4625692) (← 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)
- Theory of graph neural networks: representation and learning (Q6200219) (← links)
- Lower and upper bounds for numbers of linear regions of graph convolutional networks (Q6535213) (← links)
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability (Q6601300) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)