On the notion of bit complexity

MaRDI QIDQ4904219zbMATH OpenFDO

Authors Claus Diem

Publication date 28 January 2013

zbMATH Keywords

algorithm running timebit complexitysimulation of machinessuccessor RAMs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Fast Simulation of Turing Machines by Random Access Machines
• scientific article; zbMATH DE number 512978
• On the optimality of the binary algorithm for the Jacobi symbol
• scientific article; zbMATH DE number 3850476
• scientific article; zbMATH DE number 177809

Cited in

(3)

• On the discrete logarithm problem for plane curves
• Bit copying: the ultimate computational simplicity
• A search for Wilson primes

This page was built for publication: On the notion of bit complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904219)