Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Subject "Hilbert basis"

Now showing items 1-1 of 1

Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete

Unknown author (2007-01-01)

Boolean Algebra with Presburger Arithmetic (BAPA) combines1) Boolean algebras of sets of uninterpreted elements (BA)and 2) Presburger arithmetic operations (PA). BAPA canexpress the relationship between integer variables ...