The following pages link to (Q3549597):
Displaying 19 items.
- Even faster integer multiplication (Q306687) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- The universality of iterated hashing over variable-length strings (Q412371) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- A note on the size of OBDDs for the graph of integer multiplication (Q975522) (← links)
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Optimal tree structures for group key tree management considering insertion and deletion cost (Q1029331) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- Algorithms for monitoring real-time properties (Q1647773) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
