AI Chat AI Image Generator AI Video Text to Speech

Logical characterizations of computational complexity classes

12/14/2020

∙

by Vladimir Naidenko, et al.

∙

∙

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.

page 1

page 2

page 3

research

∙ 06/12/2022

50 Years of Computational Complexity: Hao Wang and the Theory of Computation

If Turing's groundbreaking paper in 1936 laid the foundation of the theo...

0 Nick Zhang, et al. ∙

research

∙ 11/01/2017

Credimus

We believe that economic design and computational complexity---while alr...

0 Edith Hemaspaandra, et al. ∙

research

∙ 10/09/2002

Compilability of Abduction

Abduction is one of the most important forms of reasoning; it has been s...

0 Paolo Liberatore, et al. ∙

research

∙ 05/25/2021

The Complexity of Subelection Isomorphism Problems

We study extensions of the Election Isomorphism problem, focused on the ...

0 Stanisław Szufa, et al. ∙

research

∙ 02/22/2022

Selecting cells in a raster database for maximal impact intervention in the presence of spatial interaction: Computational complexity of a Multiple vs. a Single Flow Direction

To minimize the sediment flowing to the outlet of a river catchment with...

0 Grethell Castillo-Reyes, et al. ∙

research

∙ 04/27/2020

Equivalence of grandfather and information antinomy under intervention

Causal loops, e.g., in time travel, come with two main problems. Most pr...

0 Ämin Baumeler, et al. ∙

research

∙ 06/30/2023

Computational Complexity in Algebraic Combinatorics

Algebraic Combinatorics originated in Algebra and Representation Theory,...

0 Greta Panova, et al. ∙