All challenges

Assign three colors to minimize conflicting graph edges.

Find a vertex permutation that maximizes matched edges between two graphs.

Decide graph connectivity through a hidden cut-neighborhood oracle.

Color a graph with as few colors as possible.

Transform a binary graph coloring to a target coloring using simultaneous neighbor-copy steps.

Optimize Triton GEMM with GELU for transformer-like CUDA shapes.

Optimize Triton GEMM with GELU for square CUDA matrix shapes.

Optimize a Triton GEMM with GELU for tall/skinny and short/wide matrices.

Optimize a Triton GEMM with GELU around tile-boundary dimensions.

Optimize a Triton GEMM with GELU for small and large K dimensions.

Optimize a Triton GEMM with GELU for awkward matrix dimensions.

Optimize a Triton gated dot-product attention kernel.