np-completeness
Here are 20 public repositories matching this topic...
Sort:Most stars
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
- Updated
Aug 18, 2024 - TeX
Notes of Algorithms Learning
- Updated
Aug 20, 2022 - Shell
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
- Updated
Jan 31, 2021 - Java
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
- Updated
Dec 7, 2020 - Python
🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
- Updated
Nov 8, 2020 - Python
Strip Packing Written in C++
- Updated
Jul 27, 2023 - C++
Presents a reduction from 3DM to Nonogram
- Updated
Feb 26, 2019 - HTML
Algorithms-Specialization from Stanford:
- Updated
Jul 24, 2020 - Python
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).
- Updated
Dec 20, 2021 - Jupyter Notebook
What I learned from Data Structures and Algorithms Specialization on Coursera.
- Updated
Oct 25, 2020 - C++
Foundations of Computer Science
- Updated
Aug 16, 2022 - TeX
Strategies for solving a power system network planning problem through greedy strategies, using dynamic programming and flow approximation algorithms. NP-Completeness analysis. The Min K-Cut problem
- Updated
Feb 21, 2025 - TeX
Non-Deterministic Objects library (CombView API)
- Updated
Apr 16, 2020 - C++
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
- Updated
Sep 29, 2020 - Python
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.
- Updated
Jul 5, 2022 - Python
The aim of the course is to provide a solid knowledge on how to design and analyse the most important classes of algorithms.
- Updated
Aug 22, 2020 - Java
Repositório da cadeira de Análise e Projeto de Algoritmos
- Updated
Sep 24, 2024 - HTML
An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C
- Updated
Aug 6, 2024 - C
Algorithm Analysis and Development
- Updated
Jan 21, 2024
Karp's 21st problem, called the Maximum Cut Problem, implemented into Java
- Updated
Mar 2, 2024 - Java
Improve this page
Add a description, image, and links to thenp-completeness topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thenp-completeness topic, visit your repo's landing page and select "manage topics."