On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133)

From MaRDI portal
Revision as of 03:01, 11 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 complexity of finding falsifying assignments for Herbrand disjunctions
scientific article

    Statements

    On the complexity of finding falsifying assignments for Herbrand disjunctions (English)
    0 references
    0 references
    18 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    Herbrand theorem
    0 references
    falsifying assignment
    0 references
    polynomial search problem
    0 references
    0 references
    0 references