Login / Signup
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation.
Catarina Carvalho
Florent R. Madelaine
Barnaby Martin
Dmitriy Zhuk
Published in:
CoRR (2021)
Keyphrases
</>
mixed integer
integer program
computational complexity
constraint satisfaction
worst case
higher order
computational cost
constrained optimization
probabilistic model
upper bound
decision problems
lower and upper bounds
relational databases
search algorithm
lagrange multipliers
set theoretic
complexity bounds