scientific article; zbMATH DE number 3986645
zbMATH Open0609.68039MaRDI QIDQ3750122FDOQ3750122
Authors: Giancarlo Mauri, Alberto Bertoni, N. Sabadini 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Fast Simulation of Turing Machines by Random Access Machines
- On efficient simulations of multicounter machines
- Simulation of Parallel Random Access Machines by Circuits
- scientific article; zbMATH DE number 1396672
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
- On approximating the ideal random access machine by physical machines
- Simulations by time-bounded counter machines
- Simulations by Time-Bounded Counter Machines
- On Efficient Simulations of Systolic Arrays by Random-Access Machines
- On efficient deterministic simulation of turing machine computations below logaspace
counting problemcounting functiondivision RAMequivalence problem for straight line programs on integerssatisfiability of quantified Boolean formulassimulations among RAM's with powerful instructions
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cited In (8)
- Parallel machine models: how they are and where are they going
- The problem of space invariance for sequential machines
- On Faster Integer Calculations Using Non-arithmetic Primitives
- Theory of Cryptography
- Squeezing Feasibility
- Sorting, linear time and the satisfiability problem
- Smoothing the Gap Between NP and ER
- Preface
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 Q3750122)
