Flip-graph search (in 𝔽₂ or 𝔽₃) for low-rank CP decompositions, with a focus on structured matrix multiplication.
-
Updated
Nov 27, 2025 - C++
Flip-graph search (in 𝔽₂ or 𝔽₃) for low-rank CP decompositions, with a focus on structured matrix multiplication.
Miura-ori origami flip graphs: candidate general diameter proof using convex order, majorization, and discrete Lipschitz functions, with reproducible verification.
To associate your repository with the flip-graphs topic, visit your repo's landing page and select "manage topics."