Computing a partition function of a generalized pattern-based energy over a semiring

DOI10.1007/s00224-023-10128-warXiv2305.17526OpenAlexW4383737379MaRDI QIDQ6174653

Rustem Takhanov

Publication date: 17 August 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

conditional random fieldsvalued constraint satisfactionmaximum a posteriori (MAP)pattern-based potential

Mathematics Subject Classification ID

Artificial intelligence (68Txx) Theory of computing (68Qxx) Algebraic structures (08Axx)

Cites Work

• Unnamed Item
• Unnamed Item
• Inference algorithms for pattern-based CRFs on sequence data
• Hypertree decompositions and tractable queries
• Soft arc consistency revisited
• Principles and practice of constraint programming -- CP 2010. 16th international conference, CP 2010, St. Andrews, Scotland, September 6--10, 2010. Proceedings
• On the complexity of H-coloring
• Tree clustering for constraint networks
• On the algebraic structure of combinatorial problems
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Reduction operations in fuzzy or valued constraint satisfaction
• Statistical mechanics, three-dimensionality and NP-completeness
• Effectiveness of Structural Restrictions for Hybrid CSPs
• Constraint solving via fractional edge covers
• Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
• A Proof of the CSP Dichotomy Conjecture
• Monotone monadic SNP and constraint satisfaction
• Classifying the Complexity of Constraints Using Finite Algebras
• Principles and Practice of Constraint Programming – CP 2003
• On the complexity of \(k\)-SAT

This page was built for publication: Computing a partition function of a generalized pattern-based energy over a semiring