You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Karmarkar’s Algorithm is a Polynomial-Time Interior-Point Method for Linear Programming that Efficiently Solves Large-Scale Problems by Iteratively Moving Toward Optimality Inside the Feasible Region with Complexity Roughly O(m^1.5n^2L), Significantly Improving on Prior Methods and Benefiting from Parallel Processing
x86_64 Operating System in Rust with Bootloader, Interrupt Handling, Window Manager, VGA Graphics Driver, Terminal Emulation and Software-Rendered 3D Graphics in a no_std Environment All Memory Safe
A Low-Level and Cycle Accurate Super Nintendo Emulator with WDC 65816 CPU Emulation, Full PPU Layering and Mode 7 Support, APU SPC700 & DSP Emulation, DMA/HDMA Timing, Cartridge Memory Mapping with LoROM/HiROM, and Expansion Chip Support (SA-1, SuperFX)
Enhanced Subpixel Morphological Anti-Aliasing is an Image Based Implementation of Morphological Anti-Aliasing which Detects Edges in the Final Rendered Image, Finding Specific Patterns in These Edges, and Then Blending Pixels along These Borders to Reduce Jagged Edges
ParsonLabs Video is your own personal and self-hosted YouTube, without all of the distractions that is plaguing the platform. Take Back Control — https://video.parson.dev
The Lenstra–Lenstra–Lovász (LLL) Algorithm is a Polynomial-Time Algorithm that Finds a Short and Nearly Orthogonal Basis of a Lattice, which is Used for Applications Like Factoring Polynomials, Solving Integer Linear Programming Problems, and Cryptanalysis.
Van Emde Boas (vEB) Trees are a Sophisticated Data Structure Designed to Efficiently Perform Operations on a Set of Integers Within a Fixed Universe in O(log log n)
Splay Tree is a Self-Adjusting Binary Search Tree that Dynamically Reorganizes Itself Based on Accessed or Inserted Elements by Moving the Most Recently Accessed Node to the Root Through a Series of Tree Rotations called Splaying
Cycle Accurate Game Boy Advance Emulator with ARM7TDMI CPU Emulation, Accurate BIOS and Memory Timings, Pixel-Perfect PPU Rendering, DMA, Timer and Interrupt Handling, Cartridge Save Support, Real-Time Clock Emulation, and Debuggable Execution with Audio
The DPLL Algorithm is a Complete, Backtracking-Based Search Algorithm Designed to Solve the Boolean Satisfiability Problem (SAT) for Formulas in Conjunctive Normal Form (CNF)
The General Number Field Sieve (GNFS) is the Most Efficient Classical Algorithm Known for Factoring Extremely Large Composite Integers, Typically Those Over 100 Decimal Digits (Like Those Used in RSA Cryptography)