Final Year Masters Project: modal logic solver tableaux

CSC504: Theory of Computer Science [TCS] | TE Semester V | Computer Engineering

Reduction between computational hard problems.

This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.

An implementation-neutral algorithm analysis and visualization library

Notable P vs. NP proof attempts.

Informatica teorica

This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.

GCS-Q is a coalition structure generation algorithm for induced subgraph games

🐍 Recursos disponibles de la Teoría de Complejidad

[2025 uni] Notes for "Algoritmi e Complessità" (Algorithms and Complexity analysis) course at unimi.

QuACS: Variational Quantum Algorithm for Coalition Structure Generation in Induced Subgraph Games

A toolkit for teaching, learning, and doing research in Boolean function analysis. Fourier analysis, property testing, query complexity, hypercontractivity, pseudorandomness, and more

Optimal coalition formation among Low Earth Orbit (LEO) satellites via GCS-Q algorithm.

Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart

Principia Fractalis: Fractal Resonance Ontology. A 1000+ page work exploring how mathematics, consciousness, and physical reality connect through a unified structure. Formally triple-verified in Lean 4, Coq, and L4L

A Web Client for the AutomaCoin Network.

Python Package for the ETBD

Jobs and Skills Complexity

Contains my Computational Complexity course work at MIPT