Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Longo, Davide M."'
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width, noticeably, plai
Externí odkaz:
http://arxiv.org/abs/1811.08181
