Standard

Inversion in P-Computable Fields. / Alaev, Pavel.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 2024. p. 100-109 9 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14773 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Harvard

Alaev, P 2024, Inversion in P-Computable Fields. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)., 9, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14773 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 100-109, 20th Conference on Computability in Europe, Amsterdam, Netherlands, 08.07.2024. https://doi.org/10.1007/978-3-031-64309-5_9

APA

Alaev, P. (2024). Inversion in P-Computable Fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 100-109). [9] (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14773 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-64309-5_9

Vancouver

Alaev P. Inversion in P-Computable Fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH. 2024. p. 100-109. 9. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-64309-5_9

Author

Alaev, Pavel. / Inversion in P-Computable Fields. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 2024. pp. 100-109 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{d5854be4e7eb4efd9c1769b31967e2ec,
title = "Inversion in P-Computable Fields",
abstract = "We consider fields computable in polynomial time (P-computable). We prove that under some assumptions about a P-computable field (A,+,·) of characteristic 0, there exists a P-computable field (formula presented) is not a primitive recursive function. In particular, this holds for the field Q of rational numbers.",
author = "Pavel Alaev",
note = "This study was supported by the Russian Science Foundation (grant No. 23-11-00170), https://rscf.ru/project/23-11-00170.; 20th Conference on Computability in Europe, CiE 2024 ; Conference date: 08-07-2024 Through 12-07-2024",
year = "2024",
doi = "10.1007/978-3-031-64309-5_9",
language = "English",
isbn = "9783031643088",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "100--109",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",

}

RIS

TY - GEN

T1 - Inversion in P-Computable Fields

AU - Alaev, Pavel

N1 - Conference code: 20

PY - 2024

Y1 - 2024

N2 - We consider fields computable in polynomial time (P-computable). We prove that under some assumptions about a P-computable field (A,+,·) of characteristic 0, there exists a P-computable field (formula presented) is not a primitive recursive function. In particular, this holds for the field Q of rational numbers.

AB - We consider fields computable in polynomial time (P-computable). We prove that under some assumptions about a P-computable field (A,+,·) of characteristic 0, there exists a P-computable field (formula presented) is not a primitive recursive function. In particular, this holds for the field Q of rational numbers.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85200372746&origin=inward&txGid=800eb7af6a1cd0d20a1860c1db73db2b

UR - https://www.mendeley.com/catalogue/d7812296-585c-3aee-b4d5-31e626803bab/

U2 - 10.1007/978-3-031-64309-5_9

DO - 10.1007/978-3-031-64309-5_9

M3 - Conference contribution

SN - 9783031643088

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 100

EP - 109

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Science and Business Media Deutschland GmbH

T2 - 20th Conference on Computability in Europe

Y2 - 8 July 2024 through 12 July 2024

ER -

ID: 60501020