Even delta-matroids and the complexity of planar Boolean CSPs (Q4575757)
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: Even delta-matroids and the complexity of planar Boolean CSPs |
scientific article; zbMATH DE number 6904048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Even delta-matroids and the complexity of planar Boolean CSPs |
scientific article; zbMATH DE number 6904048 |
Statements
Even Delta-Matroids and the Complexity of Planar Boolean CSPs (English)
0 references
16 July 2018
0 references
0.9875739812850952
0 references
0.8055920600891113
0 references
0.7603446245193481
0 references
0.7596397995948792
0 references
0.7553979754447937
0 references
