Structures Computable in Polynomial Time. II › Research Explorer

Novosibirsk State University's Research Portal

Structures Computable in Polynomial Time. II

Research output: Contribution to journal › Article › peer-review

Section of Algebra and Mathematical Logic

DOI

https://doi.org/10.1007/s10469-018-9465-x
Final published version

P. E. Alaev

Original language	English
Pages (from-to)	429-442
Number of pages	14
Journal	Algebra and Logic
Volume	56
Issue number	6
DOIs	https://doi.org/10.1007/s10469-018-9465-x
Publication status	Published - 1 Jan 2018

Research areas

categoricity, computable categoricity, computable stable relations, polynomially computable stable relations

OECD FOS+WOS

ID: 10453108