On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
Subramani, K.
Journal of Applied Mathematics and Decision Sciences, Tome 2009 (2009), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
DOI : https://doi.org/10.1155/2009/845804
EUDML-ID : urn:eudml:doc:232421 
@article{05637301,
     title = {On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.},
     journal = {Journal of Applied Mathematics and Decision Sciences},
     volume = {2009},
     year = {2009},
     doi = {10.1155/2009/845804},
     zbl = {1182.68091},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05637301}
}

Subramani, K. On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.. Journal of Applied Mathematics and Decision Sciences, Tome 2009 (2009) . doi : 10.1155/2009/845804. http://gdmltest.u-ga.fr/item/05637301/