Final Year Masters Project: modal logic solver tableaux

An implementation-neutral algorithm analysis and visualization library

This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.

Notable P vs. NP proof attempts.

Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart

🐍 Recursos disponibles de la Teoría de Complejidad

This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.

A Web Client for the AutomaCoin Network.

Catalog of reductions between different decision problems (SAT, 3SAT, Graph coloring, etc.)

Jobs and Skills Complexity

Contains my Computational Complexity course work at MIPT

This repo encapsulates a Python implementation of the Simulated Annealing Algorithm to solve by means of a "minimum energy state" heuristic the NP-hard n-machines|no preemption|C_max job shop scheduling problem, considering n=2 machines and jobs having release dates. The code was designed and wrote by me. The whole heuristic design, complexity a…

A series of programs that enable one's investigations in the algebraic complexity theory such as matrix multiplication algorithms, primality tests, algebraic complexity, sorting algorithms etc. Each algorithm is accompanied by a comparative time complexity analysis and a class of test cases and test suites.

Python and LaTeX source code of my MSc thesis

записки по курса ,,Машини, Езици, Сложност и Изчислимост"

An application to find the shortest route between airports using graph algorithms.

A solo project simulating and visualizing complex systems, aiming to contribute to the field of complexity theory!

20 hours of Theoretical Computer Science

experiments in calculating longest common subsequences of a set of strings (NP-Complete problem)

Just a modest Conway's Game of Life implementation in PureScript