Conceptio › Archive › Arxiv Oai Expanded
Arxiv Oai Expandedmetadata only

King Chasing Problem in Chinese Chess is NP-hard

Li, Chao et al.
Arxiv Oai Expanded · Other
Open Source ↗Direct PDF ↓
combinatorics, computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 650803
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.