complexity-theory

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.

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

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.

🐍 Recursos disponibles de la Teoría de Complejidad

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

Jobs and Skills Complexity

Python and LaTeX source code of my MSc thesis

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

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 analysis, optimization, and ideas were made possible by team-working with Arianna Montironi and Chiara Panetta. The developed heuristic is the final deliverable of our project work held during the Quantitative Methods for Decision Aid 2021 Class in Politecnico di Torino.

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.

Notes for theory of computation

Source code for the thesis entitled "Teoría de la aproximabilidad: análisis teórico y resolución práctica mediante algoritmos genéticos."

Python reference guide to build up knowledge in complexity theory, data structures and algorithms

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

Aid in understanding of asymptotic complexity theory