Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2005.05.008 / rank
Normal rank
 
Property / author
 
Property / author: John V. Franco / rank
Normal rank
 
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.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983259451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for random 3-SAT via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous results for random (\(2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: A more accurate picture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random k-SAT is 2 <sup>k</sup> (ln 2 - O(k)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near optimal seperation of tree-like and general resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / 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: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem / 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: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / 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: Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability / 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: A machine program for theorem-proving / 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: Upper bounds on the satisfiability threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random 3-sat / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results related to threshold phenomena research in satisfiability: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic performance of a heurisic for the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / 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: Analysis of Two Simple Heuristics on a Random Instance ofk-sat / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Resolution with Clauses of Bounded Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tail bounds for occupancy and the satisfiability threshold conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting Complementary Pairs of Literals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the unsatisfiability threshold of random formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on autark assignments / 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: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the matrix eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probe Order Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / 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 simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2005.05.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:44, 19 December 2024

scientific article
Language Label Description Also known as
English
Typical case complexity of satisfiability algorithms and the threshold phenomenon
scientific article

    Statements

    Typical case complexity of satisfiability algorithms and the threshold phenomenon (English)
    0 references
    10 January 2006
    0 references
    Satisfiability
    0 references
    Threshold
    0 references
    Probabilistic analysis
    0 references
    \(k\)-CNF
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers