Computational complexity of Pacti's operations #234
Unanswered
NicolasRouquette
asked this question in
Q&A
Replies: 1 comment
-
Composition, merging, and quotienting are linear in the number of constraints times a linear program of size number of constraints, each coming with its own variables. Refinement is a constant times a linear program of size number of constraints, each coming with its own variables. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
How expensive/fast are these operations?
Beta Was this translation helpful? Give feedback.
All reactions