Cliquewidth and Knowledge Compilation

DOI10.1007/978-3-642-39071-5_25zbMath1390.68509arXiv1303.4081OpenAlexW1586392743MaRDI QIDQ5326474

Igor Razgon, Justyna Petke

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4081

Mathematics Subject Classification ID

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

Related Items (2)

On Compiling CNFs into Structured Deterministic DNNFs ⋮ Parameterized edge Hamiltonicity

This page was built for publication: Cliquewidth and Knowledge Compilation