Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
Fast construction of irreducible polynomials over finite fields
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
citing papers explorer
-
On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.