Random 2-SAT and unsatisfiability (Q1607007): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5727090 / rank
 
Normal rank

Latest revision as of 12:04, 4 June 2024

scientific article
Language Label Description Also known as
English
Random 2-SAT and unsatisfiability
scientific article

    Statements

    Random 2-SAT and unsatisfiability (English)
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    2-CNF formulas
    0 references