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

From MaRDI portal
Revision as of 14:59, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers