On reducing a system of equations to a single equation
ISSAC '04: Proceedings of the 2004 international symposium on Symbolic and algebraic computation（2004）
摘要
For a system of polynomial equations over Q;p; we present an efficient construction of a single polynomial of quite small degree whose zero set over Q;p; coincides with the zero set over Q;p; of the original system. We also show that the polynomial has some other attractive features such as low additive and straight-line complexity.The proof is based on a link established here between the above problem and some recent number theoretic result about zeros of p-adic forms.
更多查看译文
关键词
single equation,p-adic form,original system,single polynomial,straight-line complexity,low additive,attractive feature,polynomial equation,efficient construction,small degree,recent number theoretic result,system of equations
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要