scientific article; zbMATH DE number 3471609

MaRDI QIDQ4055196zbMATH OpenFDO

Authors Michael S. Paterson, Michael Fischer, Albert R. Meyer

Publication date 1974

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(17)

• A note on the pebble game
• An information-theoretic approach to time bounds for on-line computation
• 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
• Fast on-line integer multiplication
• Tight hierarchy of data-independent multi-head automata
• Oblivious two-way finite automata: decidability and complexity
• Integer multiplication in time \(O(n\log n)\)
• Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
• On time versus space III
• Space-bounded simulation of multitape turing machines
• Fast online multiplication of real numbers
• Multiplication
• Complexity of multi-head finite automata: origins and directions
• The 1982 ACM Turing Award lecture. An overview of computational complexity
• Explicit methods in number theory. Abstracts from the workshop held September 1--6, 2024

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)