Towards computational complexity theory on advanced function spaces in analysis

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Research output: Contribution to conferencePaperpeer-review

Abstract

We present a concise 2nd-order representation (i.e. over finite string functions rather than infinite binary strings) and 2nd-order parametrization (i.e. over integer functions rather than over integers) of the Sobolev spaces Wpk[0; 1]; and we give various evidence that this is the 'right' choice for complexity-theoretic studies, particularly of partial differential equations.

Original languageEnglish
Pages35-37
Number of pages3
Publication statusPublished - Jan 1 2019
Externally publishedYes
Event12th International Conference on Computability and Complexity in Analysis, CCA 2015 - Tokyo, Japan
Duration: Jul 12 2015Jul 15 2015

Conference

Conference12th International Conference on Computability and Complexity in Analysis, CCA 2015
CountryJapan
CityTokyo
Period7/12/157/15/15

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Towards computational complexity theory on advanced function spaces in analysis'. Together they form a unique fingerprint.

Cite this