arXiv (All)
open access
The Computational Complexity of the Ungar Games on Distributive Lattices
The Ungar game, introduced by Defant et al., is a combinatorial game played on a finite lattice, which originates from a geometric transformation introduced by Ungar to resolve Scott's slope problem. When played on a distributive lattice $L$, the Ungar game reduces to repeatedly choosing and removin
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
- Graph Homomorphisms and Universal Algebra#1109003
- Bidding graph games with partially-observable budgets#384950
- Entwine: Coordinating Tiled Computation and Fine-Grained Communication across GPUs#999083
- Where Does Balance Break? Boundary Discovery for Game Balance Testing under a Finite Simulation Budget#792376
- Where Does Balance Break? Boundary Discovery for Game Balance Testing under a Finite Simulation Budget#788376
Record · ID 1247944
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