Longest increasing subsequence under persistent comparison errors

DOI10.1007/978-3-030-04693-4_16MaRDI QIDQ6830237zbMATH OpenFDO

Authors Barbara Geissmann

Publication date 15 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmlower boundslongest increasing subsequenceprobabilistic persistent comparison errors

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)

This page was built for publication: Longest increasing subsequence under persistent comparison errors

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