The following pages link to Z. Sweedyk (Q1356887):
Displaying 5 items.
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- (Q4389880) (← links)
- (Q4886090) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)
