Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

STOC
2005
ACM

favoriteEmaildiscussreport

111views Algorithms» more STOC 2005»

Tensor decomposition and approximation schemes for constraint satisfaction problems

14 years 10 months ago

Tensor decomposition and approximation schemes for constraint satisfaction problems

Download www-math.mit.edu

Wenceslas Fernandez de la Vega, Marek Karpinski, R

Real-time Traffic

Algorithms | Constraint Satisfaction Problems | STOC 2005 |

claim paper

Related Content

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» Best Low Multilinear Rank Approximation of HigherOrder Tensors Based on the Riemannian Tru...

» CountingBased LookAhead Schemes for Constraint Satisfaction

» New LookAhead Schemes for Constraint Satisfaction

» Fast SDP Algorithms for Constraint Satisfaction Problems

» Computing the nonnegative 3way tensor factorization using Tikhonov regularization

» Approximate L0 constrained nonnegative matrix and tensor factorization

» Approximating fractional hypertree width

» Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala

Comments (0)