Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
From MaRDI portal
Publication:3612474
DOI10.1007/978-3-540-72788-0_30zbMath1214.68360OpenAlexW1507895835MaRDI QIDQ3612474
Publication date: 10 March 2009
Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_30
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Computing Maximal Autarkies with Few and Simple Oracle Queries ⋮ Present and Future of Practical SAT Solving
This page was built for publication: Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
