# On the computational complexity of the Dirichlet Problem for Poisson's Equation

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

3 被引用数 (Scopus)

## 抄録

The last years have seen an increasing interest in classifying (existence claims in) classical mathematical theorems according to their strength. We pursue this goal from the refined perspective of computational complexity. Specifically, we establish that rigorously solving the Dirichlet Problem for Poisson's Equation is in a precise sense 'complete' for the complexity class and thus as hard or easy as parametric Riemann integration (Friedman 1984; Ko 1991. Complexity Theory of Real Functions).

本文言語 英語 1437-1465 29 Mathematical Structures in Computer Science 27 8 https://doi.org/10.1017/S096012951600013X 出版済み - 12 1 2017 はい

## All Science Journal Classification (ASJC) codes

• 数学（その他）
• コンピュータ サイエンスの応用

## フィンガープリント

「On the computational complexity of the Dirichlet Problem for Poisson's Equation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。