Final Year Masters Project: modal logic solver tableaux
-
Updated
May 26, 2022 - Python
Final Year Masters Project: modal logic solver tableaux
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
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…
Complexity
Python Package for the ETBD
20 hours of Theoretical Computer Science
Aid in understanding of asymptotic complexity theory
A modern agent-based modeling framework.
Source code for the thesis entitled "Teoría de la aproximabilidad: análisis teórico y resolución práctica mediante algoritmos genéticos."
Code, contents & publishing system for my website, and academia life | “If we keep holding onto yesterday, what are we going to be tomorrow?" - Inarizaki
simulation of the growth of a vascular network under blood flow
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."