What is a POLYNOMIAL-TIME Computable L2-Function?
arXiv:2601.17078
Abstract
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).
arXiv:2601.17078
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).