The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2023

Dates et versions

hal-04097481 , version 1 (15-05-2023)

Identifiants

Citer

Catarina Carvalho, Florent Madelaine, Barnaby Martin, Dmitriy Zhuk. The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Transactions on Computational Logic, 2023, 24 (1), pp.1-26. ⟨10.1145/3568397⟩. ⟨hal-04097481⟩

Collections

LACL UPEC ANR
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More