@article{Schmitz:2016:CHB:2889309.2858784,
    Address = {New York, NY, USA},
    Author = {Schmitz, Sylvain},
    File = {Complexity Hierarchies Beyond Elementary - Schmitz (1) (0) - a - a - s.pdf},
    ISSN = {1942-3454},
    Journal = {ACM Trans. Comput. Theory},
    Keywords = {Fast-growing complexity, subrecursion, well-quasi-order},
    Month = {February},
    Number = {1},
    Pages = {3:1--3:36},
    Publisher = {ACM},
    Title = {Complexity Hierarchies Beyond Elementary},
    URL = {http://doi.acm.org/10.1145/2858784},
    Volume = {8},
    Year = {2016},
    acmid = {2858784},
    articleno = {3},
    bdsk-url-1 = {http://doi.acm.org/10.1145/2858784},
    bdsk-url-2 = {http://dx.doi.org/10.1145/2858784},
    date-added = {2016-03-07 10:39:30 +0000},
    date-modified = {2016-03-07 10:39:30 +0000},
    file-2 = {Complexity Hierarchies Beyond Elementary - Schmitz (0) (0) - a - a - s.pdf},
    issue_date = {February 2016},
    numpages = {36},
    doi = {10.1145/2858784}
}

@article{Schmitz:2016:CHB:2889309.2858784, Address = {New York, NY, USA}, Author = {Schmitz, Sylvain}, File = {Complexity Hierarchies Beyond Elementary - Schmitz (1) (0) - a - a - s.pdf}, ISSN = {1942-3454}, Journal = {ACM Trans. Comput. Theory}, Keywords = {Fast-growing complexity, subrecursion, well-quasi-order}, Month = {February}, Number = {1}, Pages = {3:1--3:36}, Publisher = {ACM}, Title = {Complexity Hierarchies Beyond Elementary}, URL = {http://doi.acm.org/10.1145/2858784}, Volume = {8}, Year = {2016}, acmid = {2858784}, articleno = {3}, bdsk-url-1 = {http://doi.acm.org/10.1145/2858784}, bdsk-url-2 = {http://dx.doi.org/10.1145/2858784}, date-added = {2016-03-07 10:39:30 +0000}, date-modified = {2016-03-07 10:39:30 +0000}, file-2 = {Complexity Hierarchies Beyond Elementary - Schmitz (0) (0) - a - a - s.pdf}, issue_date = {February 2016}, numpages = {36}, doi = {10.1145/2858784} }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge