Source code for the book "Quantum Computing for Programmers", Cambridge University Press
-
Updated
May 31, 2024 - C++
Source code for the book "Quantum Computing for Programmers", Cambridge University Press
Leverage the power of modern C++ to build robust and scalable applications
A Faster Pseudopolynomial Time Algorithm for Subset Sum http://arxiv.org/pdf/1507.02318v1.pdf
Solves subset sum problem and returns a set of decomposed integers.
Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.
Solving subset sum problem by backtracking and Approximation approach
This repository is all about various concepts related Dynamic Programming.It also contains solutions to problems from various online judges, organized by topic.
ToWear is an application that suggests outfits to users from their closets based on the weather. We use linear regression to personalize the results to each user. Check out the current state of the app here:
mi diverto a implementare cosine
Here are some dynamic programming problem solutions.
A Python Implemented Cryptographic Algorithm Which Utilizes Public, Private Key Cryptography to Provide Congruent Super-Increasing Sets for Encryption of Data. This Algorithm relies on the SUBSET-SUM Problems NP Difficulty.
Another subset sum problem solution in natural numbers.
Given a pool of lego blocks and an image, this codeset solves the combinatorics to recreate the image in block-form.
Subset Sum Problem - Analisis for Aproximation Algorithms
Approximation and randomized algorithms - Assignment 02 - Subset Sum
Subset Sum Problem
This is a C program that computes subset sums for all possible cardinalities
Add a description, image, and links to the subset-sum topic page so that developers can more easily learn about it.
To associate your repository with the subset-sum topic, visit your repo's landing page and select "manage topics."