Taming Infinity One Chunk at a Time

Ajdarów, M., Main, J. C. A., Petr, N., & Randour, M. (2025). Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025).

Type

Preprint

Intellectual base

Grey literature

Year

2025

DOI

10.4230/lipics.icalp.2025.138

Link

https://doi.org/10.4230/LIPIcs.ICALP.2025.138

Cited by

1 citation across 1 artifact.

Domain-specific

• Square-Root Sum Problem
  • A counting-hierarchy containment is known for the standard Square-Root Sum problem, and hence a PSPACE upper bound follows, but no comparable nontrivial lower-bound classification is known.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://arxiv.org/abs/2503.00788 ×1

Registry ID ref:da413bb0d492 · see in the full table