np-completeness

Here are 3 public repositories matching this topic...

toduko / design-and-analysis-of-algorithms

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

sorting algorithms np-hard complexity graph-theory dynamic-programming lower-bounds asymptotic-analysis np-completeness np-problem

Updated Aug 18, 2024
TeX

alexwholland / CSC-320

Star

Foundations of Computer Science

grammars languages turing-machine sat-solver finite-state-automata np-completeness

Updated Aug 16, 2022
TeX

DanielMPMatCom / Energy-Distribution-Network-Optimization.-DAA-Project

Star

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

flow greedy dynamic-programming np-completeness min-k-cut

Updated Feb 21, 2025
TeX

Improve this page

Add a description, image, and links to the np-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 the np-completeness topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly