Pages that link to "Item:Q5002768"

The following pages link to Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768):

Displaying 3 items.

• A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
• Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
• Further improvements for SAT in terms of formula length (Q6077846) (← links)