Weighted automata and logics meet computational complexity

Complexity classes such as #P, ⊕P, GapP, OptP, NPMV, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class NP[S] for a suitable semiring S, defined via weighted Turing machines over S similarly as NP is defined in...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information and computation Ročník 301; s. 105213
Hlavný autor: Kostolányi, Peter
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.12.2024
Predmet:
Completeness
Semiring
Weighted complexity class
Weighted logic
Weighted Turing machine
Semiring
Weighted Turing machine
Weighted complexity class
Weighted logic
Completeness
ISSN:0890-5401
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Complexity classes such as #P, ⊕P, GapP, OptP, NPMV, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class NP[S] for a suitable semiring S, defined via weighted Turing machines over S similarly as NP is defined in the unweighted setting. Other complexity classes can be lifted to the quantitative world as well, the resulting classes relating to the original ones in the same way as weighted automata or logics relate to their unweighted counterparts. The article surveys these too-little-known connexions implicit in the existing literature and suggests a systematic approach to the study of weighted complexity classes. An extension of SAT to weighted propositional logic is proved to be complete for NP[S] when S is finitely generated. Moreover, a class FP[S] is introduced for each semiring S as a counterpart to P, and the relations between FP[S] and NP[S] are considered.
ISSN:0890-5401
DOI:10.1016/j.ic.2024.105213