On the computational complexity of the Dirichlet Problem for Poisson's Equation
From MaRDI portal
Publication:4593239
DOI10.1017/S096012951600013XzbMath1456.03069MaRDI QIDQ4593239
Akitoshi Kawamura, Martin Ziegler, Florian Steinberg
Publication date: 22 November 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
03F60: Constructive and recursive analysis
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
28A50: Integration and disintegration of measures
03D78: Computation over the reals, computable analysis
