Computing Optimal Hypertree Decompositions

DOI10.1137/1.9781611976007.1OpenAlexW2995165452MaRDI QIDQ5147487

André Schidler, Stefan Szeider

Publication date: 27 January 2021

Published in: 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

HyperBench ⋮ Computing optimal hypertree decompositions with SAT ⋮ Finding the Hardest Formulas for Resolution ⋮ Fast and parallel decomposition of constraint satisfaction problems

This page was built for publication: Computing Optimal Hypertree Decompositions