35 citations · 72 across the 5 of their papers we have counts for
1 paper · 2 filters
Dimitris Achlioptas, Assaf Naor, Yuval Peres
Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consi…