Standard

Searching for Applicable Versions of Computable Structures. / Alaev, P. E.; Selivanov, V. L.

Connecting with Computability. 2021. стр. 1-11 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12813).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Alaev, PE & Selivanov, VL 2021, Searching for Applicable Versions of Computable Structures. в Connecting with Computability. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 12813, стр. 1-11, Computability in europe-2021, 5/07/21. https://doi.org/10.1007/978-3-030-80049-9_1

APA

Alaev, P. E., & Selivanov, V. L. (2021). Searching for Applicable Versions of Computable Structures. в Connecting with Computability (стр. 1-11). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12813). https://doi.org/10.1007/978-3-030-80049-9_1

Vancouver

Alaev PE, Selivanov VL. Searching for Applicable Versions of Computable Structures. в Connecting with Computability. 2021. стр. 1-11. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-80049-9_1

Author

Alaev, P. E. ; Selivanov, V. L. / Searching for Applicable Versions of Computable Structures. Connecting with Computability. 2021. стр. 1-11 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{d184bbcddc464149916a65a898d42b3f,
title = "Searching for Applicable Versions of Computable Structures",
abstract = "We systematise notions and techniques needed for development of the computable structure theory towards applications such as symbolic algorithms and on-line algorithms. On this way, we introduce some new notions and investigate their relation to the already existing ones. In particular, in the context of polynomial-time presentability such relation turns out to depend on complexity-theoretic conjectures like P = NP.",
keywords = "Computable presentation, Grzegorczyk{\textquoteright}s presentation, Polynomial-time presentation, Quotient-structure, Structure",
author = "Alaev, {P. E.} and Selivanov, {V. L.}",
year = "2021",
month = jan,
day = "1",
doi = "10.1007/978-3-030-80049-9_1",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "1--11",
booktitle = "Connecting with Computability",
note = "Computability in europe-2021 ; Conference date: 05-07-2021",

}

RIS

TY - GEN

T1 - Searching for Applicable Versions of Computable Structures

AU - Alaev, P. E.

AU - Selivanov, V. L.

PY - 2021/1/1

Y1 - 2021/1/1

N2 - We systematise notions and techniques needed for development of the computable structure theory towards applications such as symbolic algorithms and on-line algorithms. On this way, we introduce some new notions and investigate their relation to the already existing ones. In particular, in the context of polynomial-time presentability such relation turns out to depend on complexity-theoretic conjectures like P = NP.

AB - We systematise notions and techniques needed for development of the computable structure theory towards applications such as symbolic algorithms and on-line algorithms. On this way, we introduce some new notions and investigate their relation to the already existing ones. In particular, in the context of polynomial-time presentability such relation turns out to depend on complexity-theoretic conjectures like P = NP.

KW - Computable presentation

KW - Grzegorczyk’s presentation

KW - Polynomial-time presentation

KW - Quotient-structure

KW - Structure

UR - http://www.scopus.com/inward/record.url?scp=85112193584&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-80049-9_1

DO - 10.1007/978-3-030-80049-9_1

M3 - Conference contribution

AN - SCOPUS:85112193584

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

SP - 1

EP - 11

BT - Connecting with Computability

T2 - Computability in europe-2021

Y2 - 5 July 2021

ER -

ID: 126985492