Displaying similar documents to “Time and space complexity of reversible pebbling”

Hercules versus Hidden Hydra Helper

Jiří Matoušek, Martin Loebl (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill...

Note: The Smallest Nonevasive Graph Property

Michał Adamaszek (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs...

Game list colouring of graphs.

Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity: