A prolongation-projection algorithm for computing the finite real variety of an ideal

J.B. Lasserre, M. Laurent, P. Rostalski

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
Pages (from-to)2685-2700
JournalTheoretical Computer Science: The journal of the EATCS
Volume410
Issue number27/29
Publication statusPublished - 2009

Cite this

@article{49fac656ba744c74af3b2e5510cdae89,
title = "A prolongation-projection algorithm for computing the finite real variety of an ideal",
author = "J.B. Lasserre and M. Laurent and P. Rostalski",
year = "2009",
language = "English",
volume = "410",
pages = "2685--2700",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "27/29",

}

A prolongation-projection algorithm for computing the finite real variety of an ideal. / Lasserre, J.B.; Laurent, M.; Rostalski, P.

In: Theoretical Computer Science: The journal of the EATCS, Vol. 410, No. 27/29, 2009, p. 2685-2700.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A prolongation-projection algorithm for computing the finite real variety of an ideal

AU - Lasserre, J.B.

AU - Laurent, M.

AU - Rostalski, P.

PY - 2009

Y1 - 2009

M3 - Article

VL - 410

SP - 2685

EP - 2700

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 27/29

ER -