Proves that NP_∞(R) for commutative semiring R equals weighted existential second-order logic with semiring-annotated relations, using an improved SRTM model that also reclaims prior results.
there exist q′,σ′,d,r s.t
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fagin's Theorem for Semiring Turing Machines
Proves that NP_∞(R) for commutative semiring R equals weighted existential second-order logic with semiring-annotated relations, using an improved SRTM model that also reclaims prior results.