Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6636357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sherali-Adams relaxations and indistinguishability in counting logics |
scientific article; zbMATH DE number 6636357 |
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
0.9953543543815612
0 references
0.8547717928886414
0 references
0.8161109685897827
0 references
0.804527223110199
0 references
0.7794562578201294
0 references
