The K-SAT Problem in a Simple Limit

2001/06/01 by Luca Leuzzi, Giorgio Parisi · 2 citations
Computer Science · #Constraint Satisfaction and Optimization #Optimization and Search Problems #Data Management and Algorithms

paper · doi:10.1023/a:1010388300998

Cited by

• Phase transitions and computational difficulty in random constraint satisfaction problems
• The 3-SAT problem with large number of clauses in the ∞-replica symmetry breaking scheme