Jason Yang

collaborators

2 papers

cs.CC2025

Faster search for tensor decomposition over finite fields

Jason Yang

We present an $O^{*} (∣ F ∣^{m i n {R, \sum_{d \geq 2} n_{d}} + (R - n_{0}) (\sum_{d \neq = 0} n_{d})})$ -time algorithm for determining whether the rank of a concise tensor $T\in\…

cs.CC2024

Depth-first search for tensor rank and border rank over finite fields

Jason Yang

We present an $O^{*} (∣ F ∣^{(R - n_{*}) (\sum_{d} n_{d}) + n_{*}})$ -time algorithm for determining whether a tensor of shape $n_{0} \times \dots \times n_{D - 1}$ over a fin…