Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194)
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: Sparsification upper and lower bounds for graph problems and not-all-equal SAT |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsification upper and lower bounds for graph problems and not-all-equal SAT |
scientific article |
Statements
Sparsification upper and lower bounds for graph problems and not-all-equal SAT (English)
0 references
10 October 2017
0 references
sparsification
0 references
graph coloring
0 references
Hamiltonian cycle
0 references
satisfiability
0 references
0 references
0 references
