The following pages link to Approximability of constrained LCS (Q439929):
Displaying 7 items.
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Limit Behavior of Locally Consistent Constraint Satisfaction Problems (Q3094950) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- Lower bounds for constant query affine-invariant LCCs and LTCs (Q5368746) (← links)
- A much better polynomial time approximation of consistency in the LR calculus (Q5392506) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473961) (← links)