Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection

DOI10.1137/S0895480104445009zbMath1115.68090OpenAlexW2004222819MaRDI QIDQ3440262

No author found.

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104445009

zbMATH Keywords

Boolean constraint satisfactionblossomsdelta matroids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)

Related Items (2)

Colouring, constraint satisfaction, and complexity ⋮ A Logical Approach to Constraint Satisfaction

This page was built for publication: Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection