Maximum independent sets and vertex covers of large sparse graphs.

Chess engine

This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton University algorithms Part I & II course at COURSERA

SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).

😆 Boolean formula satisfiability algorithms for JavaScript

Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).

Reference implementation of datareductions for the MWIS problem

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

Reductions from theoretical computer science

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.

Implementation of Kahan summation for MPI reductions

Approximation and randomized algorithms - PACT group 2 with Dr. Rajiv Gandhi

🌲 Reduction from the 3sat-3 problem to the maximum flow problem.

experimental fold implementation

All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay

😆 2-Satisfiability library for JavaScript

This repo provides homework solutions for the Algorithm Analysis course taught at Politehnica University of Bucharest.

Small scale scala compiler and interpreter

Compile-time generated, strongly typed in-memory reduction stores for Java.