2 papers
cs.DS2008
From k-SAT to k-CSP: Two Generalized Algorithms
Liang Li, Xin Li, Tian Liu +1
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bou…
cs.CC2007
On Exponential Time Lower Bound of Knapsack under Backtracking
Xin Li, Tian Liu
M.Aleknovich et al. have recently proposed a model of algorithms, called BT model, which generalizes both the priority model of Borodin, Nielson and Rackoff, as well as a simple dy…