New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
On nondeterministic derandomization of Freivalds' algorithm: Consequences, avenues and algorithmic progress
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.