What is a POLYNOMIAL-TIME Computable L2-Function?
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).
💡 Research Summary
This paper conducts a foundational investigation into the computational complexity of functions in the L2 space (square-integrable functions on
Comments & Academic Discussion
Loading comments...
Leave a Comment