On the complexity of skew arithmetic
DOI10.1007/S00200-015-0269-0zbMATH Open1352.68305OpenAlexW1167656794MaRDI QIDQ260085FDOQ260085
Authors: Joris van der Hoeven 
Publication date: 18 March 2016
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-015-0269-0
Recommendations
- FFT-like multiplication of linear differential operators
- Fast algorithms for polynomial solutions of linear differential equations
- scientific article; zbMATH DE number 4155781
- On the differential and full algebraic complexities of operator matrices transformations
- Products of ordinary differential operators by evaluation and interpolation
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Skew fields, division rings (12E15) Abstract differential equations (12H20)
Cites Work
- Powers of tensors and fast matrix multiplication
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Differentiably finite power series
- On fast multiplication of polynomials over arbitrary algebras
- Fast modular transforms
- Fast multiplication of polynomials over fields of characteristic 2
- Factoring in skew-polynomial rings over finite fields
- FFT-like multiplication of linear differential operators
- Theory of non-commutative polynomials
- Relax, but don't be too lazy
- Polynomial evaluation and interpolation on special sets of points
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- On the complexity of skew arithmetic
- Title not available (Why is that?)
- Evaluating Polynomials at Fixed Sets of Points
- Title not available (Why is that?)
- Formale Theorie der linearen Differentialgleichungen. (Erster Teil).
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast computation of common left multiples of linear ordinary differential operators
- Products of ordinary differential operators by evaluation and interpolation
- On the history of the theory of linear differential equations
- How to multiply matrices faster
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Matrix multiplication via arithmetic progressions
Cited In (5)
Uses Software
This page was built for publication: On the complexity of skew arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260085)
