Abstract
We show that linear differential operators with polynomial coefficients over a field of characteristic zero can be multiplied in quasi-optimal time. This answers an open question raised by van der Hoeven.
| Original language | English |
|---|---|
| Article number | 6375331 |
| Pages (from-to) | 524-530 |
| Number of pages | 7 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| DOIs | |
| Publication status | Published - 1 Dec 2012 |
| Event | 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012 - New Brunswick, NJ, United States Duration: 20 Oct 2012 → 23 Oct 2012 |
Keywords
- Linear differential operators
- algebraic algorithms
- computational complexity
- multiplication
Fingerprint
Dive into the research topics of 'Quasi-optimal multiplication of linear differential operators'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver