Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sherali-Adams relaxations and indistinguishability in counting logics |
scientific article |
Statements
Sherali-Adams relaxations and indistinguishability in counting logics (English)
0 references
7 October 2016
0 references
counting logics
0 references
graph isomorphism
0 references
lift-and-project
0 references
linear programming
0 references
pebble games
0 references
Sherali-Adams relaxations
0 references
Weisfeiler-Lehman algorithm
0 references
