Towards computational complexity theory on advanced function spaces in analysis

Akitoshi Kawamura; Florian Steinberg; Martin Ziegler

Towards computational complexity theory on advanced function spaces in analysis

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Research output: Contribution to conference › Paper › peer-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 W_p^k[0; 1]; and we give various evidence that this is the 'right' choice for complexity-theoretic studies, particularly of partial differential equations.

Original language	English
Pages	35-37
Number of pages	3
Publication status	Published - Jan 1 2019
Externally published	Yes
Event	12th International Conference on Computability and Complexity in Analysis, CCA 2015 - Tokyo, Japan Duration: Jul 12 2015 → Jul 15 2015

Conference

Conference	12th International Conference on Computability and Complexity in Analysis, CCA 2015
Country/Territory	Japan
City	Tokyo
Period	7/12/15 → 7/15/15

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications

Cite this

@conference{6cbadc0a1e164a739ef92a093343cfb9,

title = "Towards computational complexity theory on advanced function spaces in analysis",

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.",

author = "Akitoshi Kawamura and Florian Steinberg and Martin Ziegler",

year = "2019",

month = jan,

day = "1",

language = "English",

pages = "35--37",

note = "12th International Conference on Computability and Complexity in Analysis, CCA 2015 ; Conference date: 12-07-2015 Through 15-07-2015",

}

TY - CONF

T1 - Towards computational complexity theory on advanced function spaces in analysis

AU - Kawamura, Akitoshi

AU - Steinberg, Florian

AU - Ziegler, Martin

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85075931423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85075931423&partnerID=8YFLogxK

M3 - Paper

SP - 35

EP - 37

T2 - 12th International Conference on Computability and Complexity in Analysis, CCA 2015

Y2 - 12 July 2015 through 15 July 2015

ER -

Towards computational complexity theory on advanced function spaces in analysis

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this