Pages that link to "Item:Q4993300"

The following pages link to Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300):

Displaying 7 items.

• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• Computing the longest common almost-increasing subsequence (Q2166775) (← links)
• (Q5090378) (← links)
• (Q5090396) (← links)
• Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
• (Q5121902) (← links)
• (Q6084394) (← links)