Year: 2026
Type: preprint
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).
Source: arXiv (Cornell University)
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7125780951
Cites:
Cited by:
Related to: