Affine Systems of Equations and Counting Infinitary Logic

DOI10.1007/978-3-540-73420-8_49zbMath1171.68721OpenAlexW1562342192WikidataQ58215594 ScholiaQ58215594MaRDI QIDQ5428839

Andrei A. Bulatov, Anuj Dawar, Albert Atserias

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_49

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Model theory of finite structures (03C13) Other infinitary logic (03C75)

Related Items (5)

On the Descriptive Complexity of Linear Algebra ⋮ On the CSP Dichotomy Conjecture ⋮ Universal algebra and hardness results for constraint satisfaction problems ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ Dualities for Constraint Satisfaction Problems

This page was built for publication: Affine Systems of Equations and Counting Infinitary Logic