![Automated theorem proving / NP-complete problems / Unit propagation / 2-satisfiability / Time complexity / Variable / MAX-3SAT / (SAT / ε-UNSAT) / Theoretical computer science / Mathematics / Computational complexity theory Automated theorem proving / NP-complete problems / Unit propagation / 2-satisfiability / Time complexity / Variable / MAX-3SAT / (SAT / ε-UNSAT) / Theoretical computer science / Mathematics / Computational complexity theory](https://www.pdfsearch.io/img/a7c4e579e52253e83738c2b98877e98b.jpg)
| Document Date: 2008-03-02 23:12:13 Open Document File Size: 126,13 KBShare Result on Facebook
City München / / Company SIAM Journal / 3SAT / Elsevier B.V. / / / Event Reorganization / / Facility University of Munich / / IndustryTerm deterministic algorithm / computing / possible solutions / / Organization Konstantin Kutzkov Department of Computer Science / University of Munich / / Person S. Prasad Kasiviswanathan / Konstantin Kutzkov / Anna Ganeva / / Position author / Acknowledgements The author / / PublishedMedium SIAM Journal on Computing / Journal of the ACM / Theoretical Computer Science / / Technology #3-SAT algorithm / splitting algorithm / following Algorithm / doi / URL www.elsevier.com/locate/ipl / /
SocialTag |