arXiv (All)
open access
It's Hard to PArcK
We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.
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
- It's Hard to PArcK#790209
- EnsembleEGNN: Set-Based Graph Learning for Thermodynamic Ensembles of Cyclic Peptides#1144854
- RAID: Semantic Graph Diffusion for True Cold-Start and Cross-Lingual Forecasting#280204
- GraphVQ: Structure-Aware Autoregressive Decoding over Context-Quantized Graph Tokens#1141919
- Unsupervised machine learning system to automate functions on a graph structure — Bank Of America Corporation (US12547647B2)#607045
Record · ID 794228
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