On the read-once property of branching programs and CNFs of bounded treewidth (Q309788)

From MaRDI portal
Revision as of 12:49, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the read-once property of branching programs and CNFs of bounded treewidth
scientific article

    Statements

    On the read-once property of branching programs and CNFs of bounded treewidth (English)
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    read-once branching programs
    0 references
    CNFs
    0 references
    bounded treewidth
    0 references
    parameterized complexity
    0 references
    space complexity
    0 references
    lower bounds
    0 references

    Identifiers

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