Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets (Q4554934)
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 6976489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets |
scientific article; zbMATH DE number 6976489 |
Statements
Separate, Measure and Conquer (English)
0 references
12 November 2018
0 references
Max 2-CSP
0 references
measure and conquer
0 references
counting dominating sets
0 references
graph separators
0 references
0.985872447490692
0 references
0.8505995869636536
0 references
0.8344393372535706
0 references
0.8264894485473633
0 references
0.7963565587997437
0 references
