<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2017-09-02 14:08:49Theoretical computer science Logic in computer science Formal methods Computational complexity theory Mathematics Electronic design automation NP-complete problems Constraint programming Satisfiability modulo theories Boolean satisfiability problem Z3 Solver |
Add to Reading List |
Solving Constraints over Bit-Vectors with SAT-based Model Checking Extended Abstract Yakir Vizel1 , Alexander Nadel2 , and Sharad Malik1 2![PRIMITIVE VECTORS AND SLn KEITH CONRAD An n-tuple [a1 , . . . , an ] ∈ Zn is called primitive when its coordinates are relatively prime as an n-tuple. For instance, [6, 10, 15] is a primitive vector in Z3 : even though](https://www.pdfsearch.io/img/c317d3d64762073eab13f07c2ff5a1c9.jpg "PRIMITIVE VECTORS AND SLn KEITH CONRAD An n-tuple [a1 , . . . , an ] ∈ Zn is called primitive when its coordinates are relatively prime as an n-tuple. For instance, [6, 10, 15] is a primitive vector in Z3 : even though")
