Division in idealized unit cost RAMs

DOI10.1016/0022-0000(81)90041-6zbMATH Open0476.68037OpenAlexW2002158735MaRDI QIDQ1159982FDOQ1159982

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

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

Cited In (7)

• Multiplication, division, and shift instructions in parallel random access machines
• Constant-time sorting
• Does indirect addressing matter?
• Arbitrary sequence RAMs
• 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)