Ph.D. student in the Kolmogorov group

E-mail: martin.dvorak@ist.ac.at

Computer Science Track Core Course

- Constraint satisfaction and optimization (VCSP)
- Complexity theory
- Games

- Algorithms and programming
- Logic and abstract algebra
- Discrete mathematics and probability theory
- Automata, grammars, and computability
- Artificial intelligence
- C# and .NET technologies (WCF, WPF, MUI)
- Digital sound processing

NONE of these texts is a peer-reviewed publication! They serve for educational purposes and they do not contain any original discoveries.

- Unary functions – a graph of the terminology
- Generalized determinant – a detailed explanation of why the determinant for matrices over a general ring is defined as it is defined
- Pokémon games are NP-complete – a summary of a paper by Erik Demaine et. al. (full version is here) for complete beginners
- Classes of decision problems – a graph of their inclusions
- How digital money faces double-spending in decentralized environments – an essay about cryptocurrencies for complete beginners (with an emphasis on double-spending and its handling in Chia)
- Minimum 0-Extensions of Graph Metrics – an updated version of my master thesis

I started learning Lean in order to write fully-formal proofs. You can see some of my early attempts in my repository.