Polynomial-time computing over quadratic maps I

Sampling in real algebraic sets

D. Grigoriev, D.V. Pasechnik

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
Pages (from-to)20-52
JournalComputational Complexity
Volume14
Issue number1
Publication statusPublished - 2005

Cite this

Grigoriev, D. ; Pasechnik, D.V. / Polynomial-time computing over quadratic maps I : Sampling in real algebraic sets. In: Computational Complexity. 2005 ; Vol. 14, No. 1. pp. 20-52.
@article{9d519948501a42b8933e4e6988aeed55,
title = "Polynomial-time computing over quadratic maps I: Sampling in real algebraic sets",
author = "D. Grigoriev and D.V. Pasechnik",
year = "2005",
language = "English",
volume = "14",
pages = "20--52",
journal = "Computational Complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "1",

}

Polynomial-time computing over quadratic maps I : Sampling in real algebraic sets. / Grigoriev, D.; Pasechnik, D.V.

In: Computational Complexity, Vol. 14, No. 1, 2005, p. 20-52.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Polynomial-time computing over quadratic maps I

T2 - Sampling in real algebraic sets

AU - Grigoriev, D.

AU - Pasechnik, D.V.

PY - 2005

Y1 - 2005

M3 - Article

VL - 14

SP - 20

EP - 52

JO - Computational Complexity

JF - Computational Complexity

SN - 1016-3328

IS - 1

ER -