Sherali-Adams relaxations and indistinguishability in counting logics (Q2839173)
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 6184148
| 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 6184148 |
Statements
4 July 2013
0 references
first-order logic
0 references
counting quantifiers
0 references
linear programming
0 references
Weisfeiler-Lehman algorithm
0 references
graph isomorphism
0 references
combinatorial optimization
0 references
Sherali-Adams relaxations and indistinguishability in counting logics (English)
0 references
0.9953543543815612
0 references
0.8431859612464905
0 references
0.8080452680587769
0 references
0.7966966032981873
0 references
0.781782865524292
0 references
