Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"satisfiability thresholds"”.

  1. Threshold Phenomena in Random Constraint Satisfaction Problems

    Despite much work over the previous decade, the Satisfiability Threshold Conjecture remains open. Random k-SAT, for constant k >= 3, is just one family of a large number of constraint satisfaction problems that are conjectured to have exact satisfiability thresholds, but for which the existence and …

    toronto-retro Repository record for Threshold Phenomena in Random Constraint Satisfaction Problems (opens in a new tab)

  2. The satisfiability threshold of random linear equations over finite commutative rings

    … satisfaction problem (CSP). Determining the satisfiability threshold is one of the most fundamental problems in the study of any random CSP: how many constraints can a typical CSP have before it can no longer be satisfied? This question has been answered in the setting of linear equations …

    waterloo Repository record for The satisfiability threshold of random linear equations over finite commutative rings (opens in a new tab)