mirror of
https://github.com/Z3Prover/z3
synced 2025-07-29 15:37:58 +00:00
updated notes
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
be5b6f2839
commit
4c6499f28b
1 changed files with 9 additions and 4 deletions
|
@ -1324,7 +1324,7 @@ namespace polysat {
|
|||
* for every x in A_x : 0 < r(x, y0) = x*y0 - 1 < N
|
||||
|
||||
* find F_y, maximal such that
|
||||
* for every x in A_x, for every y in F_y : 0 < r(x,y), 0 <= p(x,y) < N, 0 <= q(x,y) < N
|
||||
* for every x in A_x, for every y in F_y : 0 < r(x,y) < N, 0 <= p(x,y) < N, 0 <= q(x,y) < N
|
||||
*
|
||||
* Use the fact that the coefficiens to x, y in p, q, r are non-negative
|
||||
* Note: There isn't ereally anything as negative coefficients because they are already normalized mod N.
|
||||
|
@ -1337,9 +1337,14 @@ namespace polysat {
|
|||
* max y. r(x,y) < N forall x in A_x
|
||||
* = max y . r(x_max,y) < N, where x_max = 2^128-1
|
||||
* = max y . y*x_max - 1 <= N - 1
|
||||
* = floor(N - 1 / x_max) + 1
|
||||
* = floor(N / x_max)
|
||||
* = 2^128
|
||||
*
|
||||
* max y . q(x, y) < N
|
||||
* = max y . (y + 1) * x_max - 1 <= N -1
|
||||
* = floor(N / x_max) - 1
|
||||
* = 2^128 - 1 (NSB: this is a weaker bound than what it should be. Is using "floor" too much?)
|
||||
*
|
||||
* min y . 0 < r(x,y) forall x in A_x
|
||||
* = min y . 0 < r(x_min, y)
|
||||
* = min y . 1 <= y*x_min - 1
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue