Pages that link to "Item:Q2819740"
From MaRDI portal
The following pages link to A fast algorithm for computing the \(p\)-curvature (Q2819740):
Displaying 9 items.
- Counting walks with large steps in an orthant (Q2039575) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- Fast algorithms for differential equations in positive characteristic (Q2883799) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- Computation of the Similarity Class of the p-Curvature (Q2985815) (← links)
- Fast numerical schemes related to curvature minimization: a brief and elementary review (Q4682450) (← links)
- Intrinsic Approach to Galois Theory of 𝑞-Difference Equations (Q5097145) (← links)
- Fast Algorithms for Pseudoarboricity (Q5232551) (← links)
- Algebraic solutions of linear differential equations: an arithmetic approach (Q6621309) (← links)