ISTA Publications
metadata only
Timed parity games: Complexity and robustness
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- OpenBlock: Constructive and Verified Content Generation for Adaptive Tile-Matching Games#1036860
- Automata, Computability, and Complexity#67169
- Computer Series, 75: Bits and Pieces, 30.#333116
- Trustworthy human computation: a survey#679339
- Believability testing and Bayesian imitation in interactive computer games#492793
Record · ID 247088
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive