Alexander Mayorov
Hi, I am Alexander Mayorov and this is my personal website. I am currently a computer science student at the University of Kaiserslautern-Landau. I’m also a backend and open-source developer.
Apart from studying I do research. I’m especially drawn to the study of fundamental, known and important open problems. I find it both humbling and motivating that in theoretical computer science and mathematics, so many basic questions are still open in ways that feel almost embarrassing.
My study and research interests include:
- Algorithms, complexity theory, theory of computation and related areas
- Information theory, logic, automated reasoning and formal verification
- String combinatorics, Graph theory and Ramsey theory
- Cryptography, Linear algebra and Group theory
- Formal languages, compiler design and programming languages
My hobbies include climbing, orienteering, swimming, sailing & traveling. I also love electronics, especially power electronics. My deepest intellectual passion lies in theoretical computer science and pure mathematics.
Publications
| Title | Links |
|---|---|
| Variable Independence in Linear Real Arithmetic | arXiv, presentation |
Some thoughts on Life
These are brief summaries of thoughts I’ve spent a long time wrestling with — reflections shaped by science, history, and experience. They’re not definitive, just the clearest ways I’ve found to express certain ideas. I’m sharing them in the hope that some might resonate with others, as they continue to resonate with me.
If I were a politician, others would have to rightly reject my attempts to turn life on Earth into paradise.
Unfortunately, there is always a point after which further attempts to approach the ideal will gradually lead to disaster.
Complexity is directly connected to the inability to predict future.
Whenever an intuition eludes rigorous formulation within existing theories, it becomes necessary to develop a new theory capturing it.
Justice is too heavy a responsibility to be left in human hands.
Latest posts
Computing square roots modulo a prime with the Tonelli-Shanks algorithm
Continue reading Computing square roots modulo a prime with the Tonelli-Shanks algorithm
Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE
Continue reading Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE
See Posts for more
Latest projects
Cover
Implementation of the covering algorithm for solving the variable decomposition problem in linear real arithmetic Continue reading Cover
TonelliShanks
Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number Continue reading TonelliShanks
See Projects for more
