Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Satisfiability algorithm for syntactic read-\(k\)-times branching programs
scientific article

    Statements

    Satisfiability algorithm for syntactic read-\(k\)-times branching programs (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2021
    0 references
    branching program
    0 references
    read-\(k\)-times
    0 references
    satisfiability
    0 references
    moderately exponential time
    0 references
    polynomial space
    0 references

    Identifiers

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