Pages that link to "Item:Q1179031"
From MaRDI portal
The following pages link to The parallel complexity of function approximation (Q1179031):
Displaying 14 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- The actual complexity of parallel evaluation of low degree polynomials (Q582800) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- On parallel evaluation of certain classes of polynomials with an increasing number of variables (Q804282) (← links)
- Parallel information-based complexity (Q1186504) (← links)
- Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids (Q1338215) (← links)
- Problem of checking the functional completeness in the class of piecewise parallel functions (Q2513031) (← links)
- (Q3028097) (← links)
- (Q3326718) (← links)
- (Q3792916) (← links)
- (Q4227012) (← links)
- (Q4313989) (← links)
- Parallel information-based complexity of numerical integration on holder class<i>H</i><sup><i>s,α</i></sup><sub><i>M</i></sub>(Ω)<sup>∗</sup> (Q4332460) (← links)
- Continuous functions and parallel algorithms on concrete data structures (Q6116580) (← links)