Reasoning short cuts in infinite domain constraint satisfaction: Algorithms and lower bounds for backdoors (2021)

First Author: Jonsson P.
Attributed to:  Next Generation of Algorithms for Mixed Integer Linear Programming (MILP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.4230/lipics.cp.2021.32

Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85118165989

Type: Other

Volume: 210

Parent Publication: Leibniz International Proceedings in Informatics, LIPIcs

ISSN: 18688969