5 citations · 16 across the 14 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
On the complexity of computing prime tables on a Turing machine
Igor S. Sergeev
We prove that the complexity of computing the table of primes between and on a multitape Turing machine is .
cs.DS2016★ 1 cited
On the circuit complexity of the standard and the Karatsuba methods of multiplying integers
Igor S. Sergeev
We provide accurate upper bounds on the Boolean circuit complexity of the standard and the Karatsuba methods of integer multiplication