Probabilistic Algorithms for Geometric Elimination.
We develop probabilistic algorithms that solve problems of geometric elimination theory using small memory resources. These algorithms are obtained by means of the adaptation of a general transformation due to A. Borodin which converts uniform boolean circuit depth into sequential (Turing machine) s...
| Yayımlandı: | Applicable algebra in engineering, communication and computing. 9, 6 (1999). |
|---|---|
| Yazar: | |
| Materyal Türü: | Makale |
| Dil: | İngilizce |
| Konular: |