What is a POLYNOMIAL-TIME Computable L2-Function?
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912865876705280 |
|---|---|
| author | Bacho, Aras Selivanova, Svetlana Ziegler, Martin |
| author_facet | Bacho, Aras Selivanova, Svetlana Ziegler, Martin |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_17078 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | What is a POLYNOMIAL-TIME Computable L2-Function? Bacho, Aras Selivanova, Svetlana Ziegler, Martin Computational Complexity Numerical Analysis 68Q17 (primary) 65Y20, 65D99 (secondary) F.2.1; G.1.2; G.1.8 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). |
| title | What is a POLYNOMIAL-TIME Computable L2-Function? |
| topic | Computational Complexity Numerical Analysis 68Q17 (primary) 65Y20, 65D99 (secondary) F.2.1; G.1.2; G.1.8 |
| url | https://arxiv.org/abs/2601.17078 |