10 citations · 12 across the 2 of their papers we have counts for
2 papers
math.NA2014★ 2 cited
Notes on -weak tractability: A refined classification of problems with (sub)exponential information complexity
Paweł Siedlecki, Markus Weimar
In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of con…
math.NA2011★ 10 cited
The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces
Markus Weimar
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuo…