Pages that link to "Item:Q5096139"
From MaRDI portal
The following pages link to On genuinely time bounded computations (Q5096139):
Displaying 13 items.
- Strong time bounds: Non-computable bounds and a hierarchy theorem (Q909465) (← links)
- Sharply bounded alternation and quasilinear time (Q1386656) (← links)
- Timed Sets, Functional Complexity, and Computability (Q3178279) (← links)
- (Q3327579) (← links)
- Computing in Finite Time (Q3408878) (← links)
- (Q3486864) (← links)
- (Q3639069) (← links)
- (Q3974876) (← links)
- On the complexity of genuinely polynomial computation (Q3976040) (← links)
- Lower bounds on algebraic random access machines (Q4645192) (← links)
- On lower bounds for the time of computation (Q4712356) (← links)
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (Q5145291) (← links)
- Time-Complexity Semantics for Feasible Affine Recursions (Q5425322) (← links)