Solutions to Susanna Epp's Discrete Mathematics book, 5th Edition
Python implementation of block decomposition method for approximating algorithmic complexity
Causal Deconvolution of Networks by Algorithmic Generative Models
An Algorithmic Information Theory Library (And Information-theory broadly); Implements numerous approximations, estimations, as well as a comprehensive MC-AIXI Agent & Model Ensemble platform.
Algorithmic Information Dynamics with the R Language
NhαΊp mΓ΄n PhΓ’n tΓch Δα» phα»©c tαΊ‘p thuαΊt toΓ‘n @ HCMUS
CostComplexityProfiler: Advanced Algorithmic Complexity Assessment Model with Unified Composite Score. A sophisticated static analysis tool designed to evaluate the "cost" of software projects across multiple dimensions beyond traditional time complexity.
This paper proves a fundamental impossibility theorem for universal complexity measures.
Highlighting the background, mathematical expression, algorithmic complexity and structure of the Fast Fourier Transform: one of the most influential algorithms of the 20th century.
Python implementation of block decomposition method for approximating algorithmic complexity
2025-1 - Recursos, prΓ‘cticas y proyectos de mi curso de Estructura de Datos con el profesor Canek PΓ©laez
An optimized \(O(\log n)\) number guessing game built in Python using bisection search logic. Features robust error handling with input validation, a logic-contradiction catcher to detect cheating, and custom tracking metrics that display real-time search pool reduction data.
Data and code for the triple product property (TPP) triples computational search project
WIP sorter class which will incorporate various sorting algorithms to be called from class. Intended to act as a utility sorter class where a specific sort can be selected and ran on an array. Also included in sorter class are methods to analyze the number of operations performed, by type, and the running time of these operations in CPU time.
This is the solution of a Google Interview Question asked in a video (Google Coding Interview With A College Student) in Clement Mihailescu's channel
push_swap is a sorting algorithm project from the 42/1337 curriculum, focused on sorting a stack of integers using a limited set of operations with the goal of minimizing the number of moves.
This repository documents my deep dive into systems programming and computer science fundamentals as part of the ALX Software Engineering program. It focuses on C programming and foundational concepts that power modern computing.
Toolkit for measuring protein sequence algorithmic complexity
π’ An optimized C data-sorting pipeline that resolves constrained stack sorting puzzles within strict operation count limits using runtime selection across O(n2), O(nβn), O(n log n), and a custom disorder-adaptive sorting algorithm.
How does this function's cost scale? Counted, not timed β and UNDETERMINED when no complexity class settles.
To associate your repository with the algorithmic-complexity topic, visit your repo's landing page and select "manage topics."