HyperBench
Published • Jun 17, 2019
NobleIDNI9P28W67R27S43
Authors:,,
Wolfgang Fischl
Georg Gottlob
Davide Mario Longo
Abstract
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, plain, generalized, and fractional hypertree width (hw,...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!