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

  • Department of Computer Science
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.
Original languageEnglish
Title of host publication2004 International Symposium on Symbolic and Algebraic Computation
Number of pages4
PublisherAssociation for Computing Machinery
Publication year2004
Pages163-166
ISBN (print)1-58113-827-X
DOIs
Publication statusPublished - 2004
EventInternational Symposium on Symbolic and Algebraic Computation - University of Cantabria, Santander, Spain
Duration: 4 Jul 20047 Jul 2004

Conference

ConferenceInternational Symposium on Symbolic and Algebraic Computation
LandSpain
ByUniversity of Cantabria, Santander
Periode04/07/200407/07/2004

See relations at Aarhus University Citationformats

ID: 281765