Establishes PSPACE/EXP-completeness for offset-input recurrence evaluation and PP-hardness for 3D NAND recurrences with coordinate offsets and arbitrary boundaries.
The Complexity of Algorithmic Problems on Succinct Instances
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Complexity of Recurrence Evaluation
Establishes PSPACE/EXP-completeness for offset-input recurrence evaluation and PP-hardness for 3D NAND recurrences with coordinate offsets and arbitrary boundaries.