Aarhus University Seal / Aarhus Universitets segl

On Reducing a System of Equations to a Single Equation

Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

Standard

On Reducing a System of Equations to a Single Equation. / Frandsen, G.S.; Shparlinski, I.E.

2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery, 2004. p. 163-166.

Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

Harvard

Frandsen, GS & Shparlinski, IE 2004, On Reducing a System of Equations to a Single Equation. in 2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery, pp. 163-166, International Symposium on Symbolic and Algebraic Computation, University of Cantabria, Santander, Spain, 04/07/2004. https://doi.org/10.1145/1005285.1005310

APA

Frandsen, G. S., & Shparlinski, I. E. (2004). On Reducing a System of Equations to a Single Equation. In 2004 International Symposium on Symbolic and Algebraic Computation (pp. 163-166). Association for Computing Machinery. https://doi.org/10.1145/1005285.1005310

CBE

Frandsen GS, Shparlinski IE. 2004. On Reducing a System of Equations to a Single Equation. In 2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery. pp. 163-166. https://doi.org/10.1145/1005285.1005310

MLA

Frandsen, G.S. and I.E. Shparlinski "On Reducing a System of Equations to a Single Equation". 2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery. 2004, 163-166. https://doi.org/10.1145/1005285.1005310

Vancouver

Frandsen GS, Shparlinski IE. On Reducing a System of Equations to a Single Equation. In 2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery. 2004. p. 163-166 https://doi.org/10.1145/1005285.1005310

Author

Frandsen, G.S. ; Shparlinski, I.E. / On Reducing a System of Equations to a Single Equation. 2004 International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery, 2004. pp. 163-166

Bibtex

@inbook{d516a52091ed11dcbee902004c4f4f50,
title = "On Reducing a System of Equations to a Single Equation",
abstract = "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.",
author = "G.S. Frandsen and I.E. Shparlinski",
year = "2004",
doi = "10.1145/1005285.1005310",
language = "English",
isbn = "1-58113-827-X ",
pages = "163--166",
booktitle = "2004 International Symposium on Symbolic and Algebraic Computation",
publisher = "Association for Computing Machinery",
address = "United States",
note = "International Symposium on Symbolic and Algebraic Computation ; Conference date: 04-07-2004 Through 07-07-2004",

}

RIS

TY - CHAP

T1 - On Reducing a System of Equations to a Single Equation

AU - Frandsen, G.S.

AU - Shparlinski, I.E.

PY - 2004

Y1 - 2004

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

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

U2 - 10.1145/1005285.1005310

DO - 10.1145/1005285.1005310

M3 - Book chapter

SN - 1-58113-827-X

SP - 163

EP - 166

BT - 2004 International Symposium on Symbolic and Algebraic Computation

PB - Association for Computing Machinery

T2 - International Symposium on Symbolic and Algebraic Computation

Y2 - 4 July 2004 through 7 July 2004

ER -