Pages that link to "Item:Q3581412"

The following pages link to Tensor decomposition and approximation schemes for constraint satisfaction problems (Q3581412):

Displaying 8 items.

• Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
• Randomized interpolative decomposition of separated representations (Q728743) (← links)
• A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
• Compact orbit spaces in Hilbert spaces and limits of edge-colouring models (Q896083) (← links)
• Numerical multilinear algebra and its applications (Q2477577) (← links)
• Hardness of fully dense problems (Q2643075) (← links)
• Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
• Approximate real symmetric tensor rank (Q6124794) (← links)