Affine Systems of Equations and Counting Infinitary Logic

DOI10.1007/978-3-540-73420-8_49zbMath1171.68721WikidataQ58215594 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

68Q25: Analysis of algorithms and problem complexity

08A70: Applications of universal algebra in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

03C13: Model theory of finite structures

03C75: Other infinitary logic

Related Items

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