Element Distinctness and Sorting on One-Tape Off-Line Turing Machines

DOI10.1007/978-3-540-77566-9_35zbMATH Open1132.68384OpenAlexW1761737616MaRDI QIDQ5448667

Holger Petersen

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_35

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Element distinctness on one-tape Turing machines: a complete solution

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The element distinctness problem on one-tape Turing machines 👍 👎
• The complexity of matrix transposition on one-tape off-line Turing machines 👍 👎
• The complexity of matrix transposition on one-tape off-line Turing machines with output tape 👍 👎
• 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 👍 👎

This page was built for publication: Element Distinctness and Sorting on One-Tape Off-Line Turing Machines

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