Division in idealized unit cost RAMs

DOI10.1016/0022-0000(81)90041-6MaRDI QIDQ1159982zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3568040 (Why is no real title available?)
• scientific article; zbMATH DE number 3637287 (Why is no real title available?)
• A characterization of the power of vector machines
• A unified approach to models of synchronous parallel machines
• Computational Complexity of Probabilistic Turing Machines
• Decimal-to-binary conversion of short fields
• Deterministic simulation of tape-bounded probabilistic Turing machine transducers
• On tape-bounded probabilistic Turing machine acceptors
• Parallelism in random access machines
• Some definitional suggestions for automata theory
• The complexity of computing the permanent
• Time Bounded Random Access Machines with Parallel Processing

Cited in

(7)

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

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

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