Exact Satisfiabitity with Jokers
暂无分享,去创建一个
Sanjay Jain | Frank Stephan | Sibylle Schwarz | Gordon Hoi | Sanjay Jain | F. Stephan | Gordon Hoi | S. Schwarz
[1] Serge Gaspers,et al. Separate, Measure and Conquer , 2017, ACM Trans. Algorithms.
[2] Hubie Chen. A rendezvous of logic, complexity, and algebra , 2006, SIGA.
[3] Fedor V. Fomin,et al. Exact exponential algorithms , 2013, CACM.
[4] Stefan Porschen,et al. On Some SAT-Variants over Linear Formulas , 2009, SOFSEM.
[5] Rolf Niedermeier,et al. New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.
[6] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[7] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[8] Stefan Porschen,et al. Minimizing Variable-Weighted X3SAT , 2010 .
[9] Stefan Porschen. On variable-weighted exact satisfiability problems , 2007, Annals of Mathematics and Artificial Intelligence.
[10] Henning Fernau,et al. A new upper bound for Max-2-SAT: A graph-theoretic approach , 2008, J. Discrete Algorithms.
[11] Alexander S. Kulikov,et al. A new approach to proving upper bounds for MAX-2-SAT , 2006, SODA '06.
[12] Jin-Kao Hao,et al. Three Truth Values for the SAT and MAX-SAT Problems , 2005, IJCAI.