A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655)

From MaRDI portal
Revision as of 15:16, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
scientific article

    Statements

    A satisfiability algorithm and average-case hardness for formulas over the full binary basis (English)
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    satisfiability
    0 references
    exact algorithm
    0 references
    formula
    0 references
    parity gate
    0 references
    average-case hardness
    0 references

    Identifiers