Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime

arXiv1211.4974MaRDI QIDQ6237362

Norbert Th. Müller, Carsten Rösnick, Akitoshi Kawamura, Martin Ziegler

Publication date: 21 November 2012

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime