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

DOI10.1016/0020-0190(94)00111-1zbMATH Open0941.68566OpenAlexW1994605990MaRDI QIDQ1336768FDOQ1336768

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

• Title not available (Why is that?)
• One-tape, off-line Turing machine computations
• Title not available (Why is that?)
• The complexity of matrix transposition on one-tape off-line Turing machines

Cited In (2)

• Bounds for the Element Distinctness Problem on one-tape Turing machines
• 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)