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.
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.
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.
Contains my Computational Complexity course work at MIPT
QuACS: Variational Quantum Algorithm for Coalition Structure Generation in Induced Subgraph Games
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…
Catalog of reductions between different decision problems (SAT, 3SAT, Graph coloring, etc.)
GCS-Q is a coalition structure generation algorithm for induced subgraph games
Complexity
Project dedicated to simulating and visualizing complex systems, with the goal of enhancing sociopolitical and economic decision-making.
🧑🎓 My BSc Degree Thesis in Computer Science at Sapienza Università di Roma
Optimal coalition formation among Low Earth Orbit (LEO) satellites via GCS-Q algorithm.
Add a description, image, and links to the complexity-theory topic page so that developers can more easily learn about it.
To associate your repository with the complexity-theory topic, visit your repo's landing page and select "manage topics."