Structures Computable in Polynomial Time. I › Research Explorer

Novosibirsk State University's Research Portal

Structures Computable in Polynomial Time. I

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

Section of Algebra and Mathematical Logic

DOI

https://doi.org/10.1007/s10469-017-9416-y
Final published version

P. E. Alaev

Original language	English
Pages (from-to)	421-435
Number of pages	15
Journal	Algebra and Logic
Volume	55
Issue number	6
DOIs	https://doi.org/10.1007/s10469-017-9416-y
Publication status	Published - 1 Jan 2017

OECD FOS+WOS

Research areas

computable structure, locally finite structure, polynomially categorical structure, structure computable in polynomial time, weakly polynomially categorical structure

ID: 8967988