Author:
Fedin S. S.,Kulikov A. S.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference13 articles.
1. N. Bansal and V. Raman, “Upper bounds for MaxSat: Further improved},” in: Proceedings of ISAAC’99} (1999}), pp. 247–2
2. J. M. Byskov, B. A. Madsen, and B. Skjernaa, “New algorithms for exact satisfiability},” Technical Report RS-03-30, BRICS (2003}
3. J. Chen and I. Kanj, “Improved exact algorithms for MAX-SAT},” Lect. Notes Comput. Sci.}, 2286}, 341–355 (200
4. E. Dantsin, E. A. Hirsch, S. Ivanov, and M. Vsemirnov, “Algorithms for SAT and upper bounds on their complexity},” Technical Report 01-012, Electronic Colloquium on Computational Complexity} (2001
5. M. Davis, G. Logemann, and D. Loveland, “A machine program for theorem-proving},” Comm. ACM}, 5}, 394–397 (196
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献