Geodesic
Критерий $\mathrm{P}$-вычислимости структур
Algebra i logika, Tome 61 (2022) no. 5, pp. 640-646.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{AL_2022_61_5_a6,
     author = {P. E. Alaev},
     title = {{\CYRK}{\cyrr}{\cyri}{\cyrt}{\cyre}{\cyrr}{\cyri}{\cyrishrt} $\mathrm{P}$-{\cyrv}{\cyrery}{\cyrch}{\cyri}{\cyrs}{\cyrl}{\cyri}{\cyrm}{\cyro}{\cyrs}{\cyrt}{\cyri} {\cyrs}{\cyrt}{\cyrr}{\cyru}{\cyrk}{\cyrt}{\cyru}{\cyrr}},
     journal = {Algebra i logika},
     pages = {640--646},
     publisher = {mathdoc},
     volume = {61},
     number = {5},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2022_61_5_a6/}
}
TY  - JOUR
AU  - P. E. Alaev
TI  - Критерий $\mathrm{P}$-вычислимости структур
JO  - Algebra i logika
PY  - 2022
SP  - 640
EP  - 646
VL  - 61
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2022_61_5_a6/
LA  - ru
ID  - AL_2022_61_5_a6
ER  - 
%0 Journal Article
%A P. E. Alaev
%T Критерий $\mathrm{P}$-вычислимости структур
%J Algebra i logika
%D 2022
%P 640-646
%V 61
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2022_61_5_a6/
%G ru
%F AL_2022_61_5_a6
P. E. Alaev. Критерий $\mathrm{P}$-вычислимости структур. Algebra i logika, Tome 61 (2022) no. 5, pp. 640-646. http://geodesic.mathdoc.fr/item/AL_2022_61_5_a6/

[1] D. Cenzer, J. Remmel, “Polynomial-time versus recursive models”, Ann. Pure Appl. Logic, 54:1 (1991), 17–58 | DOI | MR | Zbl

[2] P. E. Alaev, “Struktury, vychislimye za polinomialnoe vremya. I”, Algebra i logika, 55:6 (2016), 647–669 | MR

[3] P. E. Alaev, V. L. Selivanov, “Polya algebraicheskikh chisel, vychislimye za polinomialnoe vremya. I”, Algebra i logika, 58:6 (2019), 673–705 | MR

[4] D. Cenzer, J. B. Remmel, “Complexity theoretic model theory and algebra”, Handbook of recursive mathematics, v. 1, Stud. Logic Found. Math., 138, Recursive model theory, eds. Yu. L. Ershov et al., Elsevier, Amsterdam, 1998, 381–513 | DOI | MR | Zbl

[5] P. E. Alaev, “Konechno porozhdennye struktury, vychislimye za polinomialnoe vremya”, Sib. matem. zh., 63:5 (2022), 953–974

[6] P. Alaev, “Quotient structures and groups computable in polynomial time”, Computer science — theory and applications, 17th int. comput. sci. symp. in Russia, CSR 2022, Proc. (virtual event, June 29 – July 1, 2022), Lect. Notes Comput. Sci., 13296, eds. A. S. Kulikov et al., Springer, Cham, 2022, 35–45 | DOI | MR

[7] P. E. Alaev, “Slozhnost operatsii obrascheniya v gruppakh”, Algebra i logika (to appear)

[8] A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Ser. Comput. Sci. Inform. Process., Addison-Wesley Publ. Co, Reading, Mass. etc., 1974 | MR | Zbl

[9] I. Kalimullin, R. Miller, H. Schoutens, “Degree spectra for transcendence in fields”, Computing with foresight and industry, 15th conf. comput. Europe CiE 2019, Proc. (Durham, UK, July 15 –19, 2019), Lect. Notes Comput. Sci., 11558, eds. F. Manea et al., Springer, Cham, 2019, 205–216 | DOI | MR | Zbl

[10] A. T. Nurtazin, Vychislimye klassy i algebraicheskie kriterii avtoustoichivosti, Diss. kand. fiz.-mat. nauk, Alma-Ata, 1974

[11] M. Harrison-Trainor, A. Melnikov, A. Montalbán, “Independence in computable algebra”, J. Algebra, 443 (2015), 441–468 | DOI | MR | Zbl