Posts Alexander Mayorov’s blog posts.2022 Computing square roots modulo a prime with the Tonelli-Shanks algorithmContinue reading Computing square roots modulo a prime with the Tonelli-Shanks algorithm Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACEContinue reading Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE 2021 Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete Efficient algorithm for finding non-productive rules in context-free grammarsContinue reading Efficient algorithm for finding non-productive rules in context-free grammars Constructing Hilbert-style F0 proofs with a simple graph-based notationContinue reading Constructing Hilbert-style F0 proofs with a simple graph-based notation Satisfiability of formulas with both Horn and 2-SAT clauses is NP-CompleteContinue reading Satisfiability of formulas with both Horn and 2-SAT clauses is NP-Complete Implementing and visualizing Gram-Schmidt orthogonalizationContinue reading Implementing and visualizing Gram-Schmidt orthogonalization How propositional logic minimization and gray codes are connectedContinue reading How propositional logic minimization and gray codes are connected The Dining Philosophers problem and different ways of solving itContinue reading The Dining Philosophers problem and different ways of solving it Compressing images with singular value decomposition (SVD)Continue reading Compressing images with singular value decomposition (SVD) 2020 Gray codes and their beautiful symmetriesContinue reading Gray codes and their beautiful symmetries Knuth-Morris-Pratt (KMP) algorithm explainedContinue reading Knuth-Morris-Pratt (KMP) algorithm explained Visualizing 3D linear transformations and Gaussian elimination with Python and ManimContinue reading Visualizing 3D linear transformations and Gaussian elimination with Python and Manim Using the PA=LU factorization to solve linear systems of equations for many right-hand sides efficientlyContinue reading Using the PA=LU factorization to solve linear systems of equations for many right-hand sides efficiently Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard Computing the lowest common ancestor in a full binary treeContinue reading Computing the lowest common ancestor in a full binary tree Kadane's algorithm and the idea behind itContinue reading Kadane's algorithm and the idea behind it Efficient compression of congruence class automationsContinue reading Efficient compression of congruence class automations Numbers in congruence classes are regular languagesContinue reading Numbers in congruence classes are regular languages Implementing the extended Euclidean algorithm without stack or recursionContinue reading Implementing the extended Euclidean algorithm without stack or recursion 2019 Call Stack - buffer overflow vulnerabilityContinue reading Call Stack - buffer overflow vulnerability
Computing square roots modulo a prime with the Tonelli-Shanks algorithmContinue reading Computing square roots modulo a prime with the Tonelli-Shanks algorithm
Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACEContinue reading Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE
Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete
Efficient algorithm for finding non-productive rules in context-free grammarsContinue reading Efficient algorithm for finding non-productive rules in context-free grammars
Constructing Hilbert-style F0 proofs with a simple graph-based notationContinue reading Constructing Hilbert-style F0 proofs with a simple graph-based notation
Satisfiability of formulas with both Horn and 2-SAT clauses is NP-CompleteContinue reading Satisfiability of formulas with both Horn and 2-SAT clauses is NP-Complete
Implementing and visualizing Gram-Schmidt orthogonalizationContinue reading Implementing and visualizing Gram-Schmidt orthogonalization
How propositional logic minimization and gray codes are connectedContinue reading How propositional logic minimization and gray codes are connected
The Dining Philosophers problem and different ways of solving itContinue reading The Dining Philosophers problem and different ways of solving it
Compressing images with singular value decomposition (SVD)Continue reading Compressing images with singular value decomposition (SVD)
Knuth-Morris-Pratt (KMP) algorithm explainedContinue reading Knuth-Morris-Pratt (KMP) algorithm explained
Visualizing 3D linear transformations and Gaussian elimination with Python and ManimContinue reading Visualizing 3D linear transformations and Gaussian elimination with Python and Manim
Using the PA=LU factorization to solve linear systems of equations for many right-hand sides efficientlyContinue reading Using the PA=LU factorization to solve linear systems of equations for many right-hand sides efficiently
Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard
Computing the lowest common ancestor in a full binary treeContinue reading Computing the lowest common ancestor in a full binary tree
Efficient compression of congruence class automationsContinue reading Efficient compression of congruence class automations
Numbers in congruence classes are regular languagesContinue reading Numbers in congruence classes are regular languages
Implementing the extended Euclidean algorithm without stack or recursionContinue reading Implementing the extended Euclidean algorithm without stack or recursion
Call Stack - buffer overflow vulnerabilityContinue reading Call Stack - buffer overflow vulnerability