Sparsification upper and lower bounds for graphs problems and not-all-equal SAT (Q5363770)
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 6784967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparsification upper and lower bounds for graphs problems and not-all-equal SAT |
scientific article; zbMATH DE number 6784967 |
Statements
29 September 2017
0 references
sparsification
0 references
graph coloring
0 references
Hamiltonian cycle
0 references
satisfiability
0 references
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT (English)
0 references
0.997550904750824
0 references
0.8211709856987
0 references
0.819507896900177
0 references
0.7974808812141418
0 references
0.793633759021759
0 references
