![Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Automated theorem proving / Boolean algebra / NP-complete problems / Combinatorial optimization / Maximum satisfiability problem / Boolean satisfiability problem / Resolution / Unit propagation Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Automated theorem proving / Boolean algebra / NP-complete problems / Combinatorial optimization / Maximum satisfiability problem / Boolean satisfiability problem / Resolution / Unit propagation](https://www.pdfsearch.io/img/565bd003a3e7110f789dfcf114567756.jpg) Date: 2007-03-01 08:21:24Theoretical computer science Mathematics Computational complexity theory Logic in computer science Automated theorem proving Boolean algebra NP-complete problems Combinatorial optimization Maximum satisfiability problem Boolean satisfiability problem Resolution Unit propagation | | MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M AAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 116,28 KBShare Document on Facebook
|