Polynomial-time computing over quadratic maps I : sampling in real algebraic sets

Given a quadratic map Q : Kn → Kk defined over a computable subring D of a real closed field K, and p ∈ D[Y1,..., Yk] of degree d we consider the zero set Z = Z(p(Q(X)),Kn) ⊆ Kn of p(Q(X1,..., Xn)) ∈ D[X1,..., Xn]. We present a procedure that com¬putes, in (dn)O(k) arithmetic operations in D, a set...

全面介紹

Saved in:
書目詳細資料
Main Authors: Grigoriev, Dima., Pasechnik, Dmitrii V.
其他作者: School of Physical and Mathematical Sciences
格式: Article
語言:English
出版: 2011
主題:
在線閱讀:https://hdl.handle.net/10356/92360
http://hdl.handle.net/10220/6869
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English