On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
Journal of Applied Mathematics and Decision Sciences (2009)
- Volume: 2009, page Article ID 845804, 18 p.-Article ID 845804, 18 p.
- ISSN: 2090-3359
Access Full Article
top
How to cite
topSubramani, 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 2009 (2009): Article ID 845804, 18 p.-Article ID 845804, 18 p.. <http://eudml.org/doc/232421>.
@article{Subramani2009,
author = {Subramani, K.},
journal = {Journal of Applied Mathematics and Decision Sciences},
keywords = {computational complexity; satisfiability; equivalence; hull inclusion; polyhedral structure},
language = {eng},
pages = {Article ID 845804, 18 p.-Article ID 845804, 18 p.},
publisher = {Hindawi Publishing Corporation, New York},
title = {On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.},
url = {http://eudml.org/doc/232421},
volume = {2009},
year = {2009},
}
TY - JOUR
AU - Subramani, K.
TI - On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
JO - Journal of Applied Mathematics and Decision Sciences
PY - 2009
PB - Hindawi Publishing Corporation, New York
VL - 2009
SP - Article ID 845804, 18 p.
EP - Article ID 845804, 18 p.
LA - eng
KW - computational complexity; satisfiability; equivalence; hull inclusion; polyhedral structure
UR - http://eudml.org/doc/232421
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.