A Definability Dichotomy for Finite Valued CSPs
From MaRDI portal
Publication:5351950
DOI10.4230/LIPIcs.CSL.2015.60zbMath1373.68264arXiv1504.03543OpenAlexW2964259436MaRDI QIDQ5351950
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1504.03543
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Descriptive complexity and finite models (68Q19)
Related Items (2)
This page was built for publication: A Definability Dichotomy for Finite Valued CSPs