Definable subsets of polynomial-time algebraic structures › Research Explorer

Novosibirsk State University's Research Portal

Definable subsets of polynomial-time algebraic structures

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-030-50026-9_10
Final published version

Nikolay Bazhenov

Original language	English
Title of host publication	Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings
Editors	Henning Fernau
Publisher	Springer Gabler
Pages	142-154
Number of pages	13
ISBN (Print)	9783030500252
DOIs	https://doi.org/10.1007/978-3-030-50026-9_10
Publication status	Published - 1 Jan 2020
Event	15th International Computer Science Symposium in Russia, CSR 2020 - Yekaterinburg, Russian Federation Duration: 29 Jun 2020 → 3 Jul 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12159 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Computer Science Symposium in Russia, CSR 2020
Country/Territory	Russian Federation
City	Yekaterinburg
Period	29.06.2020 → 03.07.2020

Research areas

Boolean algebra, Computable structure theory, Hereditarily finite superstructure, List structure, Polynomial-time structure, ∆-definability

ID: 24722320