论文部分内容阅读
This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number of processors, the rquired precision.