Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
-
Updated
Feb 28, 2019 - TeX
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
Contains my Computational Complexity course work at MIPT
записки по курса ,,Машини, Езици, Сложност и Изчислимост"
20 hours of Theoretical Computer Science
Source code for the thesis entitled "Teoría de la aproximabilidad: análisis teórico y resolución práctica mediante algoritmos genéticos."
A modern agent-based modeling framework.
An implementation-neutral algorithm analysis and visualization library
Python and LaTeX source code of my MSc thesis
Catalog of reductions between different decision problems (SAT, 3SAT, Graph coloring, etc.)
(2019) Algorithms, Probability and Computing course
🐍 Recursos disponibles de la Teoría de Complejidad
Final Year Masters Project: modal logic solver tableaux
A Web Client for the AutomaCoin Network.
Algorithmic Operations Research
Python reference guide to build up knowledge in complexity theory, data structures and algorithms
Notes for theory of computation
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.
This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
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."