Tensor decomposition and approximation schemes for constraint satisfaction problems.
Wenceslas Fernandez de la VegaMarek KarpinskiRavi KannanSantosh S. VempalaPublished in: STOC (2005)
Keyphrases
- constraint satisfaction problems
- approximation schemes
- tensor decomposition
- auxiliary information
- constraint satisfaction
- data representation
- approximation algorithms
- high order
- constraint propagation
- np hard
- constraint programming
- np complete
- arc consistency
- tensor factorization
- non binary
- search space
- numerical methods
- visual data
- low rank
- higher order
- decomposition algorithm
- computational complexity
- special case
- partial constraint satisfaction