Division in idealized unit cost RAMs

DOI10.1016/0022-0000(81)90041-6zbMath0476.68037OpenAlexW2002158735MaRDI QIDQ1159982

Janos Simon

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90041-6

zbMATH Keywords

parallelismrandom access machineinteger divisionacceptors with severaldistributed random choicesinstruction setsprobabilistic Turing machine computationsrandom access machines with multiplication

Mathematics Subject Classification ID

Related Items (7)

P-RAM vs. RP-RAM ⋮ Does indirect addressing matter? ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Arbitrary sequence RAMs ⋮ Multiplication, division, and shift instructions in parallel random access machines ⋮ Constant-time sorting ⋮ A note on the power of integer division

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Deterministic simulation of tape-bounded probabilistic Turing machine transducers
• On tape-bounded probabilistic Turing machine acceptors
• A characterization of the power of vector machines
• Some definitional suggestions for automata theory
• Decimal-to-binary conversion of short fields
• Computational Complexity of Probabilistic Turing Machines
• Time Bounded Random Access Machines with Parallel Processing
• A unified approach to models of synchronous parallel machines
• Parallelism in random access machines

This page was built for publication: Division in idealized unit cost RAMs