New upper bounds for the problem of maximal satisfiability
作者： A. S. Kulikov , K. Kutskov
DOI: 10.1515/DMA.2009.009
关键词:
摘要:
spbu.ru
sci-hub.se 参考文章(15)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith, Algorithms based on the treewidth of sparse graphs workshop on graph theoretic concepts in computer science. pp. 385- 396 ,(2005) , 10.1007/11604686_34
Hantao Zhang, SATO: An Efficient Propositional Prover conference on automated deduction. pp. 272- 275 ,(1997) , 10.1007/3-540-63104-6_28
Alexander D Scott, Gregory B Sorkin, None, Faster Algorithms for MAX CUT and MAX CSP , with Polynomial Expected Time for Sparse Instances randomization and approximation techniques in computer science. pp. 382- 395 ,(2003) , 10.1007/978-3-540-45198-3_32
Jianer Chen, Iyad A. Kanj, Improved Exact Algorithms for MAX-SAT latin american symposium on theoretical informatics. pp. 341- 355 ,(2002) , 10.1007/3-540-45995-2_32
Alexander S. Kulikov, Automated Generation of Simplification Rules for SAT and MAXSAT Theory and Applications of Satisfiability Testing. ,vol. 3569, pp. 430- 436 ,(2005) , 10.1007/11499107_35
Ryan Williams, On Computing k-CNF Formula Properties theory and applications of satisfiability testing. pp. 330- 340 ,(2003) , 10.1007/978-3-540-24605-3_25
Rolf Niedermeier, Peter Rossmanith, New Upper Bounds for MaxSat international colloquium on automata languages and programming. pp. 575- 584 ,(1999) , 10.1007/3-540-48523-6_54
Alexander D Scott, Gregory B Sorkin, None, Linear-programming design and analysis of fast algorithms for Max 2-CSP Discrete Optimization. ,vol. 4, pp. 260- 287 ,(2007) , 10.1016/J.DISOPT.2007.08.001
Alexander S. Kulikov, Konstantin Kutzkov, New Bounds for MAX-SAT by Clause Learning Computer Science – Theory and Applications. pp. 194- 204 ,(2007) , 10.1007/978-3-540-74510-5_21
Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT Discrete Applied Mathematics. ,vol. 130, pp. 139- 155 ,(2003) , 10.1016/S0166-218X(02)00402-X