Year: 2020
Type: preprint
Abstract: Descriptive complexity theory is an important area in the study of computational complexity. In this direction, it is possible to describe combinatorial problems exclusively by logical methods, without resorting to the use of complicated algorithms. The first work in this direction was written in 1974 by the American mathematician Fagin. The article describes the development of methods of the theory of descriptive complexity.
Source: arXiv (Cornell University)
Author: Naidenko, Vladimir
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3113074468