This paper contains constructive generalizations to functions defined on spheres and projective spaces of the Jackson theorems on polynomial approximation. These results, (3.3) and (4.6), give ...
Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback