article · ArXiv.org · 2026

What is a POLYNOMIAL-TIME Computable L2-Function?

Aras Bacho, Svetlana Selivanova, Martin Ziegler

Cited by 0Open access

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).

Cite this paper

APA 7

Bacho, A., Selivanova, S., & Ziegler, M. (2026). What is a POLYNOMIAL-TIME Computable L2-Function? ArXiv.org.

MLA 9

Bacho, Aras, et al. “What is a POLYNOMIAL-TIME Computable L2-Function?” ArXiv.org, 2026.

Chicago

Bacho, Aras, Svetlana Selivanova, and Martin Ziegler. 2026. “What is a POLYNOMIAL-TIME Computable L2-Function?” ArXiv.org.

Harvard

Bacho, A., Selivanova, S. and Ziegler, M. (2026) ‘What is a POLYNOMIAL-TIME Computable L2-Function?’, ArXiv.org.

BibTeX

@article{bacho2026what,
  title = {{What is a POLYNOMIAL-TIME Computable L2-Function?}},
  author = {Bacho, Aras and Selivanova, Svetlana and Ziegler, Martin},
  journal = {ArXiv.org},
  year = {2026}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.