np-completeness
There are 18 repositories under np-completeness topic.
lijqhs/algorithms-notes
Notes of Algorithms Learning
hishamcse/Data-Structures-and-Algorithms-Specialization
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
toduko/design-and-analysis-of-algorithms
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
adriacabeza/ComplexAlgorithms
🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
R-Besson/strip-packing-cpp
Strip Packing Written in C++
bumbac/NP-problems
Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).
karenk1010/Coursera-Algorithms-Specialization
Algorithms-Specialization from Stanford:
mgfzemor/Nonogram
Presents a reduction from 3DM to Nonogram
aKhfagy/data-structures-algorithms
What I learned from Data Structures and Algorithms Specialization on Coursera.
alexwholland/CSC-320
Foundations of Computer Science
rusty-sj/Algorithms-Design-Analysis-and-Implementations
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
CombView/ndobjects
Non-Deterministic Objects library (CombView API)
fredericoguerra/TravelingTournamentProblem
This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.
jackr276/N-Puzzle-Solver
An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C
sangzzz/Advanced_Algorithms_and_Complexity
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
ZohaibRahim/Algorithm-Analysis-and-Development
Algorithm Analysis and Development
alyssarose05/Karp21MaxCut
Karp's 21st problem, called the Maximum Cut Problem, implemented into Java
emilstahl97/Algorithms-and-Data-Structures-ID1020
The aim of the course is to provide a solid knowledge on how to design and analyse the most important classes of algorithms.