scientific article; zbMATH DE number 4049049

MaRDI QIDQ3785941zbMATH OpenFDO

Authors Akeo Adachi, Takumi Kasai

Publication date 1987

zbMATH Keywords

complexity theoryindexing Turing machinemodel of computationrandom access machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast Simulation of Turing Machines by Random Access Machines
• Gradually intractable problems and nondeterministic log-space lower bounds
• Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
• scientific article; zbMATH DE number 2156275
• Automata, Languages and Programming

Cited in

(1)

• Is there a logic for polynomial time?

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 Q3785941)