Final Year Masters Project: modal logic solver tableaux

Reduction between computational hard problems.

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

An implementation-neutral algorithm analysis and visualization library

Notable P vs. NP proof attempts.

Informatica teorica

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

🐍 Recursos disponibles de la Teoría de Complejidad

A Web Client for the AutomaCoin Network.

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.

Contains my Computational Complexity course work at MIPT

🧑‍🎓 My BSc Degree Thesis in Computer Science at Sapienza Università di Roma

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

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…

Jobs and Skills Complexity

Python Package for the ETBD

A newly started project dedicated to simulating and visualizing complex systems, with the goal of enhancing sociopolitical and economic decision-making.

Python and LaTeX source code of my MSc thesis

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

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.