A simple test improves checking satisfiability

DOI10.1016/0743-1066(93)90015-9zbMath0787.68052OpenAlexW1968917402WikidataQ127363420 ScholiaQ127363420MaRDI QIDQ4036283

Eliezer L. Lozinskii

Publication date: 16 May 1993

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(93)90015-9

zbMATH Keywords

NP-completesatisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (2)

Approximate reasoning with credible subsets ⋮ Explaining by evidence

This page was built for publication: A simple test improves checking satisfiability