• Corpus ID: 117871897

# Low rank approximation of polynomials

@article{Schrijver2012LowRA,
title={Low rank approximation of polynomials},
author={Alexander Schrijver},
journal={arXiv: Combinatorics},
year={2012}
}
• A. Schrijver
• Published 15 November 2012
• Mathematics
• arXiv: Combinatorics

### UvA-DARE ( Digital Academic Repository ) Graph parameters and invariants of the orthogonal group Regts

• Computer Science
• 2013
This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.

## References

SHOWING 1-2 OF 2 REFERENCES

### Tensor decomposition and approximation schemes for constraint satisfaction problems

• Computer Science, Mathematics
STOC '05
• 2005
PTAS's for a much larger class of weighted MAX-rCSP problems which includes as special cases the dense problems and, for r = 2, all metric instances and quasimetric instances; for r > 2, this class includes a generalization of metrics.

### Szemerédi’s Lemma for the Analyst

• Mathematics
• 2007
Abstract.Szemerédi’s regularity lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph property testing, combinatorial number theory, etc. The goal of