Lower and Upper Bounds for Random Mimimum Satisfiability Problem.
Ping HuangKaile SuPublished in: FAW (2015)
Keyphrases
- satisfiability problem
- lower and upper bounds
- lower bound
- upper bound
- search algorithm
- np complete
- temporal logic
- phase transition
- upper and lower bounds
- sat problem
- random sat
- lagrangian relaxation
- stochastic local search algorithms
- randomly generated
- max sat
- sat instances
- valid inequalities
- pspace complete
- data mining
- mazurkiewicz traces
- model checking
- np hard
- special case