The Complexity of Learning SUBSEQ (A)

DOI10.1007/11894841_12zbMath1168.68398OpenAlexW115859906MaRDI QIDQ3522980

William I. Gasarch, Stephen A. Fenner

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1007/11894841_12

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

The complexity of finding SUBSEQ\((A)\)

This page was built for publication: The Complexity of Learning SUBSEQ (A)