Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption-Reference-Cited by-同舟云学术

Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption

Published:2019 Issue: Volume: Page:247-259
ISSN:0302-9743
Container-title:SOFSEM 2019: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

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

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-10801-4_20

Reference11 articles.

1. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5, 394–397 (1962)

2. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201–215 (1960)

3. Dilkina, B., Gomes, C., Sabharwal, A.: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search. Ann. Math. Artif. Intell. 70(4), 399–431 (2014)

4. Gasarch, W.: The second P =? NP poll. SIGACT News 43(2), 53–77 (2012)

5. Hemaspaandra, L., Narváez, D.: The opacity of backbones. Technical report, June 2016. arXiv:1606.03634 [cs.AI], Computing Research Repository, arXiv.org/corr/ . Accessed June 2017 to December 2018. Revised January 2017

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Structure of the Boolean Satisfiability Problem: A Survey;ACM Computing Surveys;2022-03-30

2. Existence versus exploitation: the opacity of backdoors and backbones;Progress in Artificial Intelligence;2021-03-13

3. The Power of Self-Reducibility: Selectivity, Information, and Approximation;Complexity and Approximation;2020