Kodi Addon für die Mediatheken von ARD + ZDF, Live-TV, Live-Radio, Radio-Podcasts / ARD-Audiothek, Downloads. Forum kodinerds: https://www.kodinerds.net/index.php/Thread/64244-RELEASE-Kodi-Addon-ARDundZDF/

Genetic Algorithm and Wisdom of Crowd solver for 3-SAT problem.

Fixed linear ramp schedules in QAOA constitute a universal set parameters, i.e., a set of γ and β parameters that rapidly approximate the optimal solution, x∗, independently of the COP selected, and that the success probability of finding it, probability(x∗), increases with the number of QAOA layers p.

python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time

:tv: Scrapes videos from mediatheks of ARD, ZDF, arte and 3sat.

A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.

Explore different algorithms for Maximum 0-1 Knapsack

SAT3SATAnalyzer is a comprehensive toolkit designed to solve and analyze Boolean satisfiability problems (SAT) and their specialized 3-SAT variants.

C++ 3-SAT Simulated Annealing Solver

A simple implementation of the 3SAT problem

A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem

Use Grover's algorithm to solve Boolean Satisfiability Problem and Traveling Salesman Problem

Collection of various scripts to retrieve and play media from public libraries of German TV

An implementation of the DPLL algorithm for solving SAT problems

Final project for Computability and Complexity course

Expert-level Claude Code skill for competitive algorithm mining on The Innovation Game (TIG). Develop, optimize, test, and submit algorithms for 3-SAT, CVRP, and Knapsack challenges to earn TIG tokens.

:evergreen_tree: Reduction from the 3sat-3 problem to the maximum flow problem.

Convert SAT CNF files to 3SAT version

No description provided.

A Comparison between Simulated Annealing and Artificial Bee Colony applied to MAX-3SAT

3-SAT CNF file generator

A partial 3-SAT solver

3SAT solver and integer factorizer. US nonprovisional utility patent pending application #19/439,377. Visit page at link below for licensing inquiries.

This project was designed to serve as a research-grade symbolic reasoning dashboard that helps others explore the bridge between computational logic and interactive visualization.

Proposed proof that 3SAT cannot be solved in polynomial time when traversing a search space, and a proposed constructive proof that IMSAT can be solved in polynomial time.

A (toy) SAT solver