1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2025
Fagin's Theorem for Semiring Turing Machines
Guillermo Badia, Manfred Droste, Thomas Eiter +3
In recent years, quantitative complexity over semirings has been intensively investigated. In this context, Eiter and Kiesel (Semiring Reasoning Frameworks in AI and Their Computat…
math.LO2024
Logical Characterizations of Weighted Complexity Classes
Guillermo Badia, Manfred Droste, Carles Noguera +1
Fagin's seminal result characterizing in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there h…
cs.FL2023★ 1 cited
Weighted HOM-Problem for Nonnegative Integers
Andreas Maletti, Andreea-Teodora Nász, Erik Paul
The HOM-problem asks whether the image of a regular tree language under a given tree homomorphism is again regular. It was recently shown to be decidable by Godoy, Giménez, Ramos,…