Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Najt, Elle"'
Autor:
Bosboom, Jeffrey, Brunner, Josh, Coulombe, Michael, Demaine, Erik D., Hendrickson, Dylan H., Lynch, Jayson, Najt, Elle
We analyze some of the many game mechanics available to Link in the classic Legend of Zelda series of video games. In each case, we prove that the generalized game with that mechanic is polynomial, NP-complete, NP-hard and in PSPACE, or PSPACE-comple
Externí odkaz:
http://arxiv.org/abs/2203.17167
The space of connected graph partitions underlies statistical models used as evidence in court cases and reform efforts that analyze political districting plans. In response to the demands of redistricting applications, researchers have developed sam
Externí odkaz:
http://arxiv.org/abs/2012.04564
In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use gadgets inspir
Externí odkaz:
http://arxiv.org/abs/1908.08881
In political redistricting, the compactness of a district is used as a quantitative proxy for its fairness. Several well-established, yet competing, notions of geographic compactness are commonly used to evaluate the shapes of regions, including the
Externí odkaz:
http://arxiv.org/abs/1905.03173
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.