An automated sub-exponential algorithm computes winning strategies and ranking certificate witnesses for polynomial reachability games on infinite-state real-variable graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automated Approach for Solving Infinite-state Polynomial Reachability Games
An automated sub-exponential algorithm computes winning strategies and ranking certificate witnesses for polynomial reachability games on infinite-state real-variable graphs.