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

• المؤلفون الرئيسيون: Grigoriev, Dima., Pasechnik, Dmitrii V.
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2011
• الموضوعات: DRNTU::Science::Mathematics::Applied mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/92360; http://hdl.handle.net/10220/6869

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...