TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Inhalt des Dokuments

zur Navigation

Search for Publication

Suche nach Publikationen

All Publications

On the parallel complexity of the polynomial ideal membership problem
Zitatschlüssel B-On-The-Parallel-Complexity-Of-The-Polynomial-Ideal-Membership-Problem
Autor Peter Bürgisser
Seiten 176-189
Jahr 1998
Journal J. Compl.
Jahrgang 14
Zusammenfassung The complexity of the polynomial ideal membership problem over arbitrary fields within the framwork of arithmetic networks is investigated. We prove that the parallel complexity of this problem is single exponential over any infinite field. Our lower bound is obtained by combining a modification of Mayr and Meyer's key construction (1982) with an elementary degree bound.
Link zur Publikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe