np-completeness

A Lean library for descriptive complexity: NP-completeness and the polynomial hierarchy by first-order reductions, stronger than polynomial-time (Karp) reductions. Machine-free Cook–Levin, all 21 Karp problems, on Mathlib's ModelTheory

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

Notes of Algorithms Learning

This repository contains all the solutions of assignments, starter files and other materials related to this specialization.

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

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

Strip Packing Written in C++

All the Programs of the 5th Sem Analysis of Algorithms Lab with their output in different steps. This lab provides students with hands-on experience in implementing, analyzing, and comparing fundamental algorithms. It focuses on practical exposure to algorithm design techniques such as divide and conquer, greedy methods, dynamic programming etc.

Presents a reduction from 3DM to Nonogram

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

Algorithms-Specialization from Stanford:

Research implementation of the Yang–Zhang 23-Wang-tile reduction: verified region construction, deterministic C solver, and independent tiling verification.

Foundations of Computer Science

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

What I learned from Data Structures and Algorithms Specialization on Coursera.

A formal proof, in LaTeX, that 3-Partition is NP-complete in the strong sense, following the Garey and Johnson reduction chain. MAC coursework, UGR.

An 8086 assembly quiz game on computational complexity, featuring user authentication, randomized MCQs, case-insensitive input, a 12-second timer, and a leaderboard. Built with BIOS interrupts and modular code, runs on 8086 emulators.

Azeon is a public knowledge platform. Documentation on hard ideas, starting with P vs NP. Built from first principles, written while learning.

peqnp is retired and no longer maintained. Source and historical artifacts remain available.

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.