Cutting planes width and the complexity of graph isomorphism refutations (Q6636618)
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: Cutting planes width and the complexity of graph isomorphism refutations |
scientific article; zbMATH DE number 7942536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting planes width and the complexity of graph isomorphism refutations |
scientific article; zbMATH DE number 7942536 |
Statements
Cutting planes width and the complexity of graph isomorphism refutations (English)
0 references
12 November 2024
0 references
proof complexity
0 references
cutting planes
0 references
cutwidth
0 references
linear programming
0 references
Weisfeiler-Leman algorithm
0 references
graph isomorphism
0 references
\(k\)-variable fragment first-order counting logic
0 references
Hella's bijective pebble game
0 references
0 references
0 references
