What is a POLYNOMIAL-TIME Computable L2-Function?
Abstract
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP1 includes #P1).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.