Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT (Q5363770)

From MaRDI portal
Revision as of 09:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6784967
Language Label Description Also known as
English
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
scientific article; zbMATH DE number 6784967

    Statements

    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references