Leitung

Prof. Dr. Peter Bürgisser

Anschrift
Technische Universität Berlin
Institut für Mathematik
Sekretariat MA 3-2
Straße des 17. Juni 136
10623 Berlin

Büro
Raum MA 317 (3. OG)
Institut für Mathematik

Sekretariat
Beate Nießen
Raum MA 318
Tel.: +49 (0)30 314 - 25771

eMail
pbuerg@math.tu-berlin.de
contact form

Telefon
+49 (0)30 314 - 75902

Faxgerät
+49 (0)30 314 - 25839

Sprechstunde
Während der Vorlesungszeit: Do, 15-16 Uhr.
Während der vorlesungsfreien Zeit: nach Vereinbarung.

On randomized semialgebraic decision complexity
Zitatschlüssel	BKL-On-Randomized-Semialgebraic-Decision-Complexity
Autor	Peter Bürgisser and Marek Karpinski and Thomas Lickteig
Seiten	231-251
Jahr	1993
Journal	J. Compl.
Jahrgang	9
Nummer	2
Zusammenfassung	We investigate the impact of randomization on the complexity of deciding membership in a (semi-)algebraic subset $X$ in $\mathbb R^m$. Examples are exhibited, where allowing for a certain error probability in the answer of the algorithms the complexity of decision problems decreases. A randomized decision tree over $m$ will be defined as a pair $(T,u)$ where $u$ is a probability measure on some $\mathbb R^n$ and $T$ is a decision tree over $m+n$. We prove a general lower bound on the average decision complexity for testing membership in an irreducible algebraic subset $X$ in $\mathbb R^m$ and apply it to $k$-generic complete intersection of polynomials of the same degree, extending results in Buergisser, Lickteig, and Shub (1992), and Buergisser (1992). We also give applications to nongeneric cases, such as graphs of elementary symmetric functions, $\mathrm S\mathrm L(m,\mathbb R)$, and determinant varieties, extending results in Lickteig (1990).