Complexity Hierarchies Beyond Elementary¶
Schmitz, S. (2013). Complexity Hierarchies Beyond Elementary.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Nonelementary Problem
- The nonelementary claim is about the problem's inherent worst-case growth over input sizes, rather than a large runtime observed for one algorithm or input.
This sourceIt describes WS1S satisfiability and star-free-expression equivalence as nonelementary and introduces a finer hierarchy, with Tower as a class between elementary and primitive-recursive.
- The nonelementary claim is about the problem's inherent worst-case growth over input sizes, rather than a large runtime observed for one algorithm or input.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8e925abebfbf · see in the full table