Pages that link to "Item:Q909465"
From MaRDI portal
The following pages link to Strong time bounds: Non-computable bounds and a hierarchy theorem (Q909465):
Displaying 12 items.
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- On proving time constructibility of functions (Q1059393) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- Composition is almost (but not quite) as good as \(s-1-1\) (Q1314366) (← links)
- Sharply bounded alternation and quasilinear time (Q1386656) (← links)
- A nonasymptotic lower time bound for a strictly bounded second-order arithmetic (Q2498915) (← links)
- (Q3355230) (← links)
- Nontriviality for Exponential Time w.r.t. Weak Reducibilities (Q3569066) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
- (Q3974876) (← links)
- On genuinely time bounded computations (Q5096139) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)