Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies

DOI10.1007/11814948_14zbMath1187.68267OpenAlexW1517452162MaRDI QIDQ5756566

Yuliya Zabiyaka, Adnan Darwiche

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Visualizing SAT instances and runs of the DPLL algorithm

This page was built for publication: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies