加载中…
We exhibit an algorithm to solve the following extension problem: Given a finite set and a function $f: E \rightarrow FL^{m,p}(^n)p>n$, with norm having the smallest possible order of magnitude, and secondly, compute the order of magnitude of the norm of . Here, denotes the Sobolev space consisting of functions on whose th order partial derivatives belong to . The running time of our algorithm is at most , where denotes the cardinality of , and is a constant depending only on ,, and .

生成讲解博客的中文版本

生成AI智能校验的中文版本