Unary weighted automata over the tropical semiring admit a polynomial-time computable quadratic-size union representation of deterministic automata, implying coNP-completeness of determinisation and register minimisation.
Parameterized Complexity Theory
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.
citing papers explorer
-
Complexity of Clique-Guarded First-Order Logic with Counting
cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.