A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q673601
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: John V. Franco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001835703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Index for Satisfiability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Horn sets in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized satisfiability problems: Minimal elements and phase transitions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial sharpness criterion and phase transition classification for random CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics methods and phase transitions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds for certain Ramsey properties of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for renaming a set of clauses as a Horn set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for Random Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding solutions for extended Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability / rank
 
Normal rank

Latest revision as of 14:56, 11 June 2024

scientific article
Language Label Description Also known as
English
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
scientific article

    Statements

    A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    sharp satisfiability threshold
    0 references
    \(q\)-Horn
    0 references
    renameable-Horn
    0 references
    random formula
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers