Descriptive complexity and weighted Turing machines

Read full text Summarise with VIRAT
Authors: Guillermo Badía, Manfred Droste, Carles Noguera, Erik Paul
Cited by: 0
References: 45

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Fagin's seminal result characterizing NP in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted) models of computations. In this paper, we start the study of descriptive complexity based on weighted Turing machines over arbitrary semirings. We provide machine-independent characterizations (over ordered structures) of the weighted complexity classes NP[S], L[S], FP[S], FPLOG[S], FPSPACE[S], and FPSPACEpoly[S] in terms of definability in suitable weighted logics for an arbitrary semiring S. In particular, we state and prove weighted versions of Fagin's theorem (even for arbitrary structures, not necessarily ordered, provided that the semiring is idempotent and commutative), the Immerman-Vardi's theorem (originally for P) and the Abiteboul-Vianu-Vardi's theorem (originally for PS PACE). We also discuss a recent open problem proposed by Eiter and Kiesel. Recently, the above mentioned weighted complexity classes have been investigated in connection to classical counting complexity classes. Furthermore, several classical counting complexity classes have been characterized in terms of particular weighted logics over the semiring & Nopf; of natural numbers. In this work, we cover several of these classes and obtain new results for others such as NPMV, (R) P, or the collection of real-valued languages realized by nondeterministic polynomial-time real-valued Turing machines. Furthermore, our results apply to classes based on many other important semirings, such as the max-plus and the min-plus semirings over the natural numbers which correspond to the classical classes MaxP[O(log n)] and MinP[O(log n)], respectively.

Fields of Study & Subjects

semigroups and automata theory Complexity and Algorithms in Graphs Advanced Graph Theory Research

Publication details

Journal / source
Information and Computation
Volume
310
Pages
105446–105446
Publication date
27 March 2026
Language
EN