2976 search results - page 18 / 596 » On the bounded integer programming |
JSC
1998
13 years 7 months ago
1998
Abstract. In this paper we give new, improved explicit upper bounds for the absolute values of the integer solutions and for the heights of S-integer solutions of elliptic equation...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
STACS
2001
Springer
14 years 42 min ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
