scientific article; zbMATH DE number 512852

MaRDI QIDQ4281548zbMATH OpenFDO

Authors Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide

Publication date 7 April 1994

zbMATH Keywords

computation treescomputational power of integer division

Mathematics Subject Classification ID

Theory of programming languages (68N15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4072374
• A lower bound for integer greatest common divisor computations
• Lower Bounds for Computations with the Floor Operation
• Log Depth Circuits for Division and Related Problems

Cited in

(8)

• The complexity of divisibility
• On Faster Integer Calculations Using Non-arithmetic Primitives
• scientific article; zbMATH DE number 4072374 (Why is no real title available?)
• On computations with integer division
• scientific article; zbMATH DE number 1254004 (Why is no real title available?)
• A lower bound for integer greatest common divisor computations
• Dividing by zero -- how bad is it, really?
• Lower bounds on algebraic random access machines

This page was built for publication:

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