Satisfiability threshold for random XOR-CNF formulas

This publication has 11 references indexed in Scilit:

• Tail bounds for occupancy and the satisfiability threshold conjecture
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Analysis of Two Simple Heuristics on a Random Instance ofk-sat
  Journal of Algorithms, 1996
• Complexity of Generalized Satisfiability Counting Problems
  Information and Computation, 1996
• A threshold for unsatisfiability
  Published by Springer Nature ,1992
• Mick gets some (the odds are on his side) (satisfiability)
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• Advanced Combinatorics
  Published by Springer Nature ,1974
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• On the Limit Distribution of the Number of Solutions of a Random System of Linear Equations in the Class of Boolean Functions
  Theory of Probability and Its Applications, 1967
• Matrices over a Finite Field
  The American Mathematical Monthly, 1966