Upper and Lower Bounds for Weak Backdoor Set Detection

DOI10.1007/978-3-642-39071-5_29zbMath1390.68353arXiv1304.5518OpenAlexW2170769481MaRDI QIDQ5326478

Venkatesh Raman, Neeldhara Misra, Stefan Szeider, Sebastian Ordyniak

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/1304.5518

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Upper and Lower Bounds for Weak Backdoor Set Detection