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

Reductions from theoretical computer science

Implementation of Kahan summation for MPI reductions

😆 2-Satisfiability library for JavaScript

Iteratively optimizing parallel reductions in CUDA.

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

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

experimental fold implementation

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

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

Small scale scala compiler and interpreter

Canonical reduction templates and proof sketches connecting URF problems with Boolean SAT and general CSP formulations.

🎮 Solutions for the game found in http://oeis.org/A070214