np-completeness

There are 0 repository under np-completeness topic.

lijqhs / algorithms-notes
Notes of Algorithms Learning
graph linear-programming mergesort quicksort regular-expressions trie heapsort kmp-algorithm minimum-spanning-trees priority-queue shortest-paths sorting-algorithms binary-search-trees hashtables maximum-flow substring-search symbol-table np-completeness algorithms computer-science
Language:Shell 9
hishamcse / Data-Structures-and-Algorithms-Specialization
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
data-structures algorithms greedy-algorithms divide-and-conquer dynamic-programming graph-algorithms string-algorithms suffix-trees genome-assembly debruijn-graph streaming-algorithms sorting-algorithms searching-algorithms linear-programming maxflow shortest-paths minimum-spanning-trees np-completeness burrows-wheeler-transform sat
Language:Java 8
adriacabeza / ComplexAlgorithms
🧙🏾‍♂️ Complex Algorithms and Complexity Course from the University of San Diego
algorithm complexity flow-networks linear-programming np-completeness streaming-algorithms python3
Language:Python 3
R-Besson / strip-packing-cpp
Strip Packing Written in C++
algorithms np-complete packing packing-algorithm packing-algorithms np-complete-problems np-completeness strip-packing
Language:C++ 3
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).
np-completeness np-complete np-hard knapsack simulated-annealing genetic-algorithm
Language:Jupyter Notebook 2
karenk1010 / Coursera-Algorithms-Specialization
Algorithms-Specialization from Stanford:
algorithms data-structures dynamic-programming python3 greedy-algorithms divide-and-conquer randomized-algorithms sorting-algorithms graphs hash-tables np-completeness spanning-trees
Language:Python 2
mgfzemor / Nonogram
Presents a reduction from 3DM to Nonogram
nonogram 3dm 3-dimensional-matching np-completeness
Language:HTML 2
aKhfagy / data-structures-algorithms
What I learned from Data Structures and Algorithms Specialization on Coursera.
graph-algorithms network-flow linear-programming np-completeness greedy-algorithms divide-and-conquer dynamic-programming disjoint-sets disjoint-unions hashing-algorithms binary-search-tree minimum-spanning-trees suffix-tree suffix-array burrows-wheeler-transform knuth-morris-pratt eulerian-path de-bruijn-graphs satisfiability-problem
Language:C++ 1
alexwholland / CSC-320
Foundations of Computer Science
finite-state-automata grammars languages np-completeness sat-solver turing-machine
Language:TeX 1
rusty-sj / Algorithms-Design-Analysis-and-Implementations
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
prime-factorization sorting-algorithms dfs-search n-queens quicksort mergesort heapsort bubblesort backtracking 8-puzzle sliding-puzzle graph-algorithms bfs-search prims-algorithm kruskals-algorithm edmund-karp-algorithm dinic-algorithm network-flow ford-fulkerson-algorithm np-completeness
Language:Python 1
CombView / ndobjects
Non-Deterministic Objects library (CombView API)
combview cpp library non-deterministic non-deterministic-programming np-completeness np-hard optimization
Language:C++ 0
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.
combinatorial-optimization heuristics iterated-local-search metaheuristics np-completeness np-hard traveling-tournament
Language:Python 0
sangzzz / Advanced_Algorithms_and_Complexity
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
python network-flows linear-programming p-vs-np np-completeness
Language:Python 0
ZohaibRahim / Algorithm-Analysis-and-Development
Algorithm Analysis and Development
algorithms analysis-of-algorithm assertions loop-invariants np-completeness program-correctness asymptotic-complexity asymptotic-notation comparision-of-sorting-algorithms correctness-proofs data-type-invariants development-of-algorithm recurssion-relationship
0
alyssarose05 / Karp21MaxCut
Karp's 21st problem, called the Maximum Cut Problem, implemented into Java
java max-cut-problem np-completeness school-project
Language: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.
greedy-algorithms np-completeness complexity binary-trees algorithms-and-data-structures algorithms data-structures java
Language:Java