The following pages link to (Q4427903):
Displaying 8 items.
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers (Q453505) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
