The following pages link to Joshua Brakensiek (Q2090126):
Displaying 6 items.
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← 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)
