2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Download PDF

Abstract

We extend Kawamura and Cook's framework for computational complexity for operators in analysis. This model is based on second-order complexity theory for functionals on the Baire space, which is lifted to metric spaces via representations. Time is measured in the length of the input encodings and the output precision.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles