Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
#

np-completeness

Here are 20 public repositories matching this topic...

Записките ми за упражнения по "Дизайн и анализ на алгоритми"

  • UpdatedAug 18, 2024
  • TeX

🧙🏾‍♂️ Complex Algorithms and Complexity Course from the University of San Diego

  • UpdatedNov 8, 2020
  • Python

Presents a reduction from 3DM to Nonogram

  • UpdatedFeb 26, 2019
  • HTML

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).

  • UpdatedDec 20, 2021
  • Jupyter Notebook

Foundations of Computer Science

  • UpdatedAug 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

  • UpdatedFeb 21, 2025
  • TeX

Non-Deterministic Objects library (CombView API)

  • UpdatedApr 16, 2020
  • C++

Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.

  • UpdatedSep 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.

  • UpdatedJul 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.

  • UpdatedAug 22, 2020
  • Java
N-Puzzle-Solver

An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

  • UpdatedAug 6, 2024
  • C

Karp's 21st problem, called the Maximum Cut Problem, implemented into Java

  • UpdatedMar 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.

Curate this topic

Add this topic to your repo

To associate your repository with thenp-completeness topic, visit your repo's landing page and select "manage topics."

Learn more


[8]ページ先頭

©2009-2025 Movatter.jp