The following pages link to (Q3549597):
Displaying 47 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)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast enumeration of words generated by Dyck grammars (Q2342339) (← links)
- Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X]\) (Q2344290) (← links)
- New results on the most significant bit of integer multiplication (Q2429728) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- On the hardnesses of several quantum decoding problems (Q2677282) (← links)
- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices (Q2868656) (← links)
- A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space (Q2958350) (← links)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- Faster algorithms for the square root and reciprocal of power series (Q3081289) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- Faster integer multiplication using plain vanilla FFT primes (Q4683179) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates (Q5090147) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Faster integer multiplication using short lattice vectors (Q6165872) (← links)
