rinha-de-algoritmos
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
- 171
- Python
- MIT
- 3 y ago
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
Implementation and Evaluation of "Genetic" and "Simulated Annealing" algorithms for Extended version of Travelling Salesman Problem.
Position-Candidate-Hypothesis (PCH) is a theoretical paradigm for structural-statistical analysis of NP-complete problems.
Joint (Maths & Computer Science) Senior Honours project on Graph Homomorphisms.
This repository presents a constructive and complete proof of the P≠NP problem, based on structural separation and recursive unconstructibility. 本リポジトリは、構成的手法によりP≠NP問題を完全に証明した理論を収録しています。構成不能性と分離構造に基づく新たなアプローチです。
Algorithms Part - I and Part - II Courses by Princeton University - Coursera Community