The complexity of parity graph homomorphism: an initial investigation (Q2941645)
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 6474903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of parity graph homomorphism: an initial investigation |
scientific article; zbMATH DE number 6474903 |
Statements
21 August 2015
0 references
complexity theory
0 references
graph homomorphisms
0 references
modular counting
0 references
dichotomy theorem
0 references
0.806367814540863
0 references
0.7998257875442505
0 references
0.7981495261192322
0 references
0.7958387732505798
0 references
