We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.

翻译：我们显示,确定四方形系统在$\mathbb{C}$、$\mathbb{R}$和$\mathbb{R}$是否可行的问题需要指数时间。这在BCSS计算模型中将P和NP区分在这些字段/环上。