Pages that link to "Item:Q4029500"
From MaRDI portal
The following pages link to TIME BOUNDED COMPUTATIONS OVER THE REALS (Q4029500):
Displaying 9 items.
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Timed Sets, Functional Complexity, and Computability (Q3178279) (← links)
- (Q3330503) (← links)
- Computing in Finite Time (Q3408878) (← links)
- (Q4268461) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)