Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q673601
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: John V. Franco / rank
 
Normal rank

Revision as of 11:53, 20 February 2024

scientific article
Language Label Description Also known as
English
Unique satisfiability of Horn sets can be solved in nearly linear time
scientific article

    Statements

    Unique satisfiability of Horn sets can be solved in nearly linear time (English)
    0 references
    0 references
    0 references
    0 references
    6 September 1995
    0 references
    0 references
    Horn clauses
    0 references
    Horn set
    0 references