- Hulette, D. 'Computer Science for All' (Really). Princeton University, Princeton, NJ, Mar. 1, 2016; https://www.cs.princeton.edu/news/'computer-science-all'-reallyGoogle Scholar
- Sedgewick, R. A 21st Century Model for Disseminating Knowledge. Princeton University, Princeton, NJ; http://www.cs.princeton.edu/~rs/talks/Model.pdfGoogle Scholar
Index Terms
- No backdoor required or expected
Recommendations
Backdoor Sets for DLL Subsolvers
We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently introduced by Williams, Gomes, and Selman for explaining the `heavy-...
The backdoor key: a path to understanding problem hardness
AAAI'04: Proceedings of the 19th national conference on Artifical intelligenceWe introduce our work on the backdoor key, a concept that shows promise for characterizing problem hardness in backtracking search algorithms. The general notion of backdoors was recently introduced to explain the source of heavy-tailed behaviors in ...
Backdoor sets of quantified boolean formulas
SAT'07: Proceedings of the 10th international conference on Theory and applications of satisfiability testingWe generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas in conjunctive normal form (QCNF). We develop parameterized algorithms that admit uniform polynomial time QCNF evaluation parameterized by the size of ...
Comments