Abstract
We investigate properties of sets having no infinite subset in a given family of sets. We study the case when this family is defined by a complexity measure or one of the usual complexity notions in automata or recursive function theory.
Cite
CITATION STYLE
APA
Flajolet, P., & Steyaert, J. M. (1974). On sets having only hard subsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14 LNCS, pp. 446–457). Springer Verlag. https://doi.org/10.1007/3-540-06841-4_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free