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 this page instead for the normal view: Sherali-Adams relaxations and indistinguishability in counting logics |
scientific article; zbMATH DE number 6184148
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
