The element distinctness problem on one-tape Turing machines

DOI10.1016/0020-0190(96)00108-1MaRDI QIDQ671603zbMATH OpenOpenAlexFDO

Authors Andrzej Szepietowski

Publication date 27 February 1997

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

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

zbMATH Keywords

Computational complexityElement Distinctness ProblemTuring machinesUpper and lower bounds

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Bounds for the Element Distinctness Problem on one-tape Turing machines
• Element distinctness on one-tape Turing machines: a complete solution
• Sorting and Element Distinctness on One-Way Turing Machines
• Element Distinctness and Sorting on One-Tape Off-Line Turing Machines
• Two time-space tradeoffs for element distinctness

Cites work

• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• New lower bounds for element distinctness on a one-tape Turing machine

Cited in

(4)

• Bounds for the Element Distinctness Problem on one-tape Turing machines
• Element distinctness on one-tape Turing machines: a complete solution
• Sorting and Element Distinctness on One-Way Turing Machines
• Element Distinctness and Sorting on One-Tape Off-Line Turing Machines

This page was built for publication: The element distinctness problem on one-tape Turing machines

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