Computing characteristic polynomials of p-curvatures in average polynomial time
From MaRDI portal
Cites work
- A conjecture in the arithmetic theory of differential equations
- A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
- A search for Wilson primes
- An Introduction to "G"-Functions. (AM-133)
- Characteristic polynomials of p-adic matrices
- Computation of the Similarity Class of the p-Curvature
- Computing the Lie algebra of the differential Galois group of a linear differential system
- Counting points on hyperelliptic curves in average polynomial time
- scientific article; zbMATH DE number 3708534 (Why is no real title available?)
- scientific article; zbMATH DE number 1236965 (Why is no real title available?)
- scientific article; zbMATH DE number 2151182 (Why is no real title available?)
- scientific article; zbMATH DE number 1860838 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Hypergeometric expressions for generating functions of walks with small steps in the quarter plane
- Integer multiplication in time \(O(n\log n)\)
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity of computing determinants
- The complete generating function for Gessel walks is algebraic
This page was built for publication: Computing characteristic polynomials of p-curvatures in average polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666554)
