scientific article; zbMATH DE number 3471609
From MaRDI portal
Publication:4055196
zbMATH Open0301.68059MaRDI QIDQ4055196FDOQ4055196
Authors: Michael S. Paterson, Michael Fischer, Albert R. Meyer 
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (15)
- An information-theoretic approach to time bounds for on-line computation
- Tight hierarchy of data-independent multi-head automata
- Fast on-line integer multiplication
- Complexity of multi-head finite automata: origins and directions
- Oblivious two-way finite automata: decidability and complexity
- Integer multiplication in time \(O(n\log n)\)
- A note on the pebble game
- Fast online multiplication of real numbers
- Space complexity in on-line computation
- The network complexity and the Turing machine complexity of finite functions
- Multi-head finite automata: Data-independent versus data-dependent computations
- Multiplication
- Space-bounded simulation of multitape turing machines
- Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
- On time versus space III
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 Q4055196)
