P vs NP, Computational Complexity, Circuit Complexity, Randomized Algorithms
An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
arxiv.org·2d
Can AI generate truly novel algorithms?
research.ibm.com·4d
Correction: A Comprehensive Behavioral Dataset for the Abstraction and Reasoning Corpus
nature.com·1h
StateSort — Fastest Comparison Sort?
pub.towardsai.net·17h
UnderColor’s spiral challenge from 1984 – part 3
subethasoftware.com·19h
Optimizing our way through Metroid
antithesis.com·1h
Time-Optimal Directed q-Analysis
arxiv.org·9h
Optimizing multiprecision LLL in FLINT
fredrikj.net·1d
Loading...Loading more...