On constraint satisfaction problems below P

DOI10.1093/logcom/exu003zbMath1353.68118arXiv1312.4428OpenAlexW2120593287MaRDI QIDQ2826030

László Egri

Publication date: 7 October 2016

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4428

zbMATH Keywords

branching programs(nondeterministic) logspaceconstrain satisfaction problemsDatalog fragments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

This page was built for publication: On constraint satisfaction problems below P