An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552)

From MaRDI portal
Revision as of 01:07, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 1931461
Language Label Description Also known as
English
An Upper Bound on the Space Complexity of Random Formulae in Resolution
scientific article; zbMATH DE number 1931461

    Statements

    An Upper Bound on the Space Complexity of Random Formulae in Resolution (English)
    0 references
    0 references
    2002
    0 references
    satisfiability threshold
    0 references
    random unsatisfiable Boolean formula
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references