![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Alon N. Shapira A.
Publisher: Elsevier
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.47, Iss.2, 2003-07, pp. : 87-103
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The complexity of minimal satisfiability problems
By Kirousis L.M. Kolaitis P.G.
Information and Computation, Vol. 187, Iss. 1, 2003-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Easy Cases of Probabilistic Satisfiability
Annals of Mathematics and Artificial Intelligence, Vol. 33, Iss. 1, 2001-09 ,pp. :