Approximation and randomized algorithms - PACT group 2 with Dr. Rajiv Gandhi
-
Updated
Aug 30, 2022
Approximation and randomized algorithms - PACT group 2 with Dr. Rajiv Gandhi
😆 2-Satisfiability library for JavaScript
🌲 Reduction from the 3sat-3 problem to the maximum flow problem.
All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay
experimental fold implementation
Reductions from theoretical computer science
This repo provides homework solutions for the Algorithm Analysis course taught at Politehnica University of Bucharest.
Implementation of Kahan summation for MPI reductions
🎮 Solutions for the game found in http://oeis.org/A070214
😆 Boolean formula satisfiability algorithms for JavaScript
Small scale scala compiler and interpreter
Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).
Chess engine
SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).
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
Maximum independent sets and vertex covers of large sparse graphs.
Add a description, image, and links to the reductions topic page so that developers can more easily learn about it.
To associate your repository with the reductions topic, visit your repo's landing page and select "manage topics."