Tensor decomposition and approximation schemes for constraint satisfaction problems

DOI10.1145/1060590.1060701zbMath1192.68920OpenAlexW2074447841MaRDI QIDQ3581412

Santosh Vempala, Wenceslas Fernandez de la Vega, Marek Karpinski, Ravindran Kannan

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060701

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (9)

Hardness of fully dense problems ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Optimal cuts and partitions in tree metrics in polynomial time ⋮ Compact orbit spaces in Hilbert spaces and limits of edge-colouring models ⋮ Approximate real symmetric tensor rank ⋮ Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. ⋮ Regularity lemmas in a Banach space setting ⋮ Numerical multilinear algebra and its applications ⋮ Randomized interpolative decomposition of separated representations

This page was built for publication: Tensor decomposition and approximation schemes for constraint satisfaction problems