The following pages link to Joshua Brakensiek (Q2090126):
Displaying 15 items.
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions (Q4575716) (← links)
- (Q4608006) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5032036) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Constant-factor approximation of near-linear edit distance in near-linear time (Q5144954) (← links)
- Symmetric Polymorphisms and Efficient Decidability of Promise CSPs (Q5146783) (← links)
- Bridging between 0/1 and linear programming via random walks (Q5212799) (← links)
- CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801) (← links)
- New hardness results for graph and hypergraph colorings (Q5368748) (← links)
- (Q6176154) (← links)
- Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes (Q6195759) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
