Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: SDDs are Exponentially More Succinct than OBDDs
A Lower Bound on the Size of Decomposable Negation Normal Form
Symbolic Boolean manipulation with ordered binary-decision diagrams
Graph Isomorphism in Quasipolynomial Time
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
Parameterized Complexity
General Lower Bounds based on Computer Generated Higher Order Expansions
A lightweight component caching scheme for satisfiability solvers
An Alternative Proof of The Schwartz-Zippel Lemma.
Some Open Problems in Fine-Grained Complexity
AnO(ND) difference algorithm and its variations
Implementing the Davis–Putnam Method
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Invitation to fixed-parameter algorithms
A Compiler for Deterministic, Decomposable Negation Normal Form
XSat: A Fast Floating-Point Satisfiability Solver
Learning the Structure of Probabilistic Sentential Decision Diagrams
Exact (exponential) algorithms for the dominating set problem
Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
FO Model Checking on Posets of Bounded Width
Compiling probabilistic logic programs into sentential decision diagrams
Diabetes mellitus: a "thrifty" genotype rendered detrimental by "progress"?
Graph-Based Algorithms for Boolean Function Manipulation
The life-cycle of Subulura suctoria (Mol., 1860) rail and henry, 1912 in the domestic fowl
Three cases of laparoscopic myomectomy performed during pregnancy for pedunculated uterine myomas
Congenital proptosis secondary to orbital teratoma. Clinicopathological study.