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

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

Research output: Contribution to journal › Article › Scientific › peer-review

Original language	English
Pages (from-to)	2685-2700
Journal	Theoretical Computer Science: The journal of the EATCS
Volume	410
Issue number	27/29
Publication status	Published - 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: The journal of the EATCS",

issn = "1879-2294",

publisher = "Elsevier",

number = "27/29",

}

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

SN - 1879-2294

VL - 410

SP - 2685

EP - 2700

JO - Theoretical Computer Science: The journal of the EATCS

JF - Theoretical Computer Science: The journal of the EATCS

IS - 27/29

ER -