Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 748
Volume 748, November 2018
- Erik D. Demaine, Fabrizio Grandoni:
Editorial fun. 1 - Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber:
Algorithms and insights for RaceTrack. 2-16 - Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are hard. 17-27 - Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The fewest clues problem. 28-39 - Felix Herter, Günter Rote:
Loopless Gray code enumeration and the Tower of Bucharest. 40-54 - Marzio De Biasi, Tim Ophelders:
The complexity of snake and undirected NCL variants. 55-65 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-Hard. 66-76
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.