scientific article; zbMATH DE number 5485562
From MaRDI portal
Publication:5302073
zbMath1231.68289MaRDI QIDQ5302073
Chandan Saha, Ramprasad Saptharishi, Piyush P. Kurur, Anindya De
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Complexity of computation in finite fields ⋮ A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space ⋮ New results on the most significant bit of integer multiplication ⋮ On the OBDD complexity of the most significant bit of integer multiplication ⋮ Fast integer multiplication using generalized Fermat primes ⋮ Relaxed Hensel lifting of triangular sets ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ On the complexity of computing with planar algebraic curves ⋮ Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size
This page was built for publication:
