]>On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls : Table 3
Table 3: Complexities of Integer hull inclusion problems over various polyhedral families.
Polyhedral systemHull inclusion
DiffP
2SATP
TUMP
HorncoNP-complete