The iterated mod problem

DOI10.1016/0890-5401(89)90008-4zbMath0671.68013MaRDI QIDQ1119390

Howard J. Karloff, Walter L. Ruzzo

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90008-4

zbMATH Keywords

complexity; parallelism; Euclidean algorithm; concurrency

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D15: Complexity of computation (including implicit computational complexity)

11A63: Radix representation; digital problems

Related Items

Unnamed Item, Better complexity bounds for cost register automata, Leaf languages and string compression, Knapsack problems for NL, Unbounded recursion and non-size-increasing functions, Better complexity bounds for cost register automata, Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel approximation algorithms for bin packing
• Efficient parallel algorithms for linear recurrence computation
• Factoring polynomials with rational coefficients
• Fast Parallel Computation of Polynomials Using Few Processors
• A taxonomy of problems with fast parallel algorithms
• Parallel computation for well-endowed rings and space-bounded probabilistic machines
• Computing Powers in Parallel
• The parallel complexity of exponentiating polynomials over finite fields
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• Fast parallel matrix and GCD computations
• A Determinant Theorem with Applications to Parallel Algorithms
• Hiding information and signatures in trapdoor knapsacks