National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Bounds on existence of odd and unique expanders
Hlásek, Filip ; Koucký, Michal (advisor) ; Šámal, Robert (referee)
We study the existence of expander graphs with a focus on odd and unique expanders. The main goal is to describe configurations of arguments for which there is no infinite family of expanders. The most imporant result is that for every graph there is a nonempty subset of at most half of its vertices, such that every other vertex is connected at least twice to the subset or not connected to the subset at all. It follows that certain classes of unique expanders cannot exist. On the other hand we present some configurations for which there are families of expanders. Powered by TCPDF (www.tcpdf.org)
Deciphering tool for puzzlehunt games
Hlásek, Filip ; Mareček, David (advisor) ; Rosa, Rudolf (referee)
The thesis focuses on substitution ciphers used at puzzlehunt games. First, we collect samples of the language which is used in the texts, that we are interested in. Furthermore, we propose a language model specially designed for working with sparse data. After that, we will explore the ways of searching for probable solutions and we will present a straightforward algorithm. Then we will improve it and make it more efficient. A significant part of the project is a console application, which serves as a deciphering tool. It is able to solve more than 15 % out of the ciphers, on which it has been tested. The result can be improved if the user inputs his current geography location. In this case, the program will search just for nearby places. That will allow the deciphering tool to explore more options and achieve a better precision. Powered by TCPDF (www.tcpdf.org)

Interested in being notified about new results for this query?
Subscribe to the RSS feed.