The precise complexity of finding rainbow even matchings (Q2175422)
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: The precise complexity of finding rainbow even matchings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The precise complexity of finding rainbow even matchings |
scientific article |
Statements
The precise complexity of finding rainbow even matchings (English)
0 references
29 April 2020
0 references
matching
0 references
Max-Cut
0 references
exponential time hypothesis
0 references
Ising partition function
0 references
