New lower bounds for element distinctness on a one-tape Turing machine

DOI10.1016/0020-0190(94)00111-1MaRDI QIDQ1336768zbMATH OpenOpenAlexFDO

Authors Alejandro Lopez-Ortiz

Publication date 26 February 1996

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00111-1

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites work

• scientific article; zbMATH DE number 3646282 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• One-tape, off-line Turing machine computations
• The complexity of matrix transposition on one-tape off-line Turing machines

Cited in

(2)

• The element distinctness problem on one-tape Turing machines
• Bounds for the Element Distinctness Problem on one-tape Turing machines

This page was built for publication: New lower bounds for element distinctness on a one-tape Turing machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336768)