Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2011.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997804344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: Flaws and structure / 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: A sharp threshold in proof complexity yields lower bounds for satisfiability search / 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: Rigorous results for random (\(2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for<i>K</i>-SAT at large clause-to-variable ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems / 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: An exponential separation between regular and general resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / 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: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold values of random <i>K</i>‐SAT from the cavity method / 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: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting Complementary Pairs of Literals / 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: Q4704799 / 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: Q3597149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-XORSAT threshold. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two solutions to diluted \(p\)-spin models and XORSAT problems / 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: Generalized satisfiability problems: Minimal elements and phase transitions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for Random Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When does the giant component bring unsatisfiability? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of randomly generated binary constraint satisfaction problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiability threshold for randomly generated binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing an asymptotic phase transition in random binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples in exact phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random \(k\)-SAT: A tight threshold for moderately growing \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for a random constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Resolution Complexity of Random Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudden emergence of a giant \(k\)-core in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores in random hypergraphs and Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encores on cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson Cloning Model for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The<i>k</i>-Core and Branching Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank

Latest revision as of 00:29, 5 July 2024

scientific article
Language Label Description Also known as
English
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
scientific article

    Statements

    Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (English)
    0 references
    13 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    random CSP
    0 references
    DPLL
    0 references
    threshold
    0 references
    algorithms
    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