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.
Fine-grained complexity of ambiguity problems on automata and directed graphs
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
Curvature-guided localization and low-rank repair detoxifies backdoored LLMs by suppressing trigger responses while preserving normal behavior.
citing papers explorer
-
Representing One Letter Weighted Automata Over the Tropical Semiring
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.
-
Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
-
Curvature-Guided Module Localization for Low-Rank Detoxification of Backdoored Large Language Models
Curvature-guided localization and low-rank repair detoxifies backdoored LLMs by suppressing trigger responses while preserving normal behavior.