scientific article
From MaRDI portal
Publication:3549597
zbMath1179.68198MaRDI QIDQ3549597
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (49)
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions ⋮ Even faster integer multiplication ⋮ On efficiency of notations for natural numbers ⋮ Algorithms for monitoring real-time properties ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Dirichlet’s proof of the three-square theorem: An algorithmic perspective ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ Complexity of computation in finite fields ⋮ Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates ⋮ Algorithms for Propositional Model Counting ⋮ On the hardnesses of several quantum decoding problems ⋮ On the OBDD Complexity of the Most Significant Bit of Integer Multiplication ⋮ Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems ⋮ Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity ⋮ The universality of iterated hashing over variable-length strings ⋮ A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space ⋮ Faster integer multiplication using short lattice vectors ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ New results on the most significant bit of integer multiplication ⋮ On the OBDD complexity of the most significant bit of integer multiplication ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform ⋮ Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization ⋮ Relaxed Hensel lifting of triangular sets ⋮ The parameterized complexity of the rainbow subgraph problem ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ A note on the size of OBDDs for the graph of integer multiplication ⋮ Algorithms for propositional model counting ⋮ Controlled non-uniform random generation of decomposable structures ⋮ A low complexity probabilistic test for integer multiplication ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Faster polynomial multiplication over finite fields using cyclotomic coefficient rings ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Computing modular polynomials in quasi-linear time ⋮ Faster integer multiplication using plain vanilla FFT primes ⋮ Computing rank-width exactly ⋮ Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size ⋮ Faster algorithms for the square root and reciprocal of power series ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms ⋮ Optimal tree structures for group key tree management considering insertion and deletion cost ⋮ Interpolation of polynomials given by straight-line programs ⋮ An exact algorithm for subgraph homeomorphism ⋮ Fast enumeration of words generated by Dyck grammars ⋮ Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X\)] ⋮ Maximum Distance Separable Codes Based on Circulant Cauchy Matrices
This page was built for publication:
