Existence versus exploitation: the opacity of backdoors and backbones under a weak assumption

DOI10.1007/978-3-030-10801-4_20zbMath1444.68128arXiv1706.04582OpenAlexW2798358466MaRDI QIDQ2206234

David E. Narváez, Hemaspaandra, Lane A.

Publication date: 22 October 2020

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07)

Related Items (1)

The Power of Self-Reducibility: Selectivity, Information, and Approximation

This page was built for publication: Existence versus exploitation: the opacity of backdoors and backbones under a weak assumption