🎨 Graph Coloring

Constraint Satisfaction, Register Allocation, Scheduling Problems, Algorithmic Graph Theory

2025-06-24: GPU Hours Granted on Hypothesis Generation by Oak Ridge Leadership Computing Facility
ws-dl.blogspot.com·1d·
Discuss: ws-dl.blogspot.com
🏴󠁧󠁢󠁳󠁣󠁴󠁿Scottish Computing
Single Core Hundred Thousand Concurrency（1750866547511600）
dev.to·2h·
Discuss: DEV
🌊Stream Processing
🧠 Solving LeetCode Until I Become Top 1% — Day `30`
dev.to·10h·
Discuss: DEV
📐Error Bounds
The AI Agent schism: deterministic vs. non deterministic
writing.kunle.app·30m·
Discuss: Hacker News
⚡Proof Automation
In which I write a library-quality B+ tree with the genies
tidyfirst.substack.com·3h·
Discuss: Substack
🦀Rust Macros
Godel's Incompleteness Theorem
news.ycombinator.com·1h·
Discuss: Hacker News
🔤Type Theory
Elmo's World NP-complete problem (2006)
blog.plover.com·1d·
Discuss: Hacker News
🧮SMT Solvers
NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling
arxiv.org·14h
🔗Topological Sorting
Show HN: TableSprint- Supabase alternative with vibe coding features
tablesprint.com·15h·
Discuss: Hacker News
📲Digitization
Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
arxiv.org·1d
🎯Performance Proofs
Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
arxiv.org·1d
🧮Kolmogorov Complexity
End of the line for coding LLMs will do a better job. How do I pay my mortgage?
daniel-payne-keldan-systems.medium.com·1d·
Discuss: Hacker News
🏴󠁧󠁢󠁳󠁣󠁴󠁿Scottish Computing
Agentic AI: Implementing Long-Term Memory
towardsdatascience.com·22h
💾Persistence Strategies
Cost-Effective Optimization and Implementation of the CRT-Paillier Decryption Algorithm for Enhanced Performance
arxiv.org·1d
🔢Bitwise Algorithms
4-input 2-output Boolean circuits (2020)
cp4space.hatsya.com·1d·
Discuss: Hacker News
⚙️Logic Synthesis
Algorithm Complexity: Time, Space, and Big-O Notation
dev.to·8h·
Discuss: DEV
🧮Kolmogorov Complexity
Distribution of codewords on the faces of a hypercube and new combinatorial identities
arxiv.org·1d
⚽Sphere Packing
BNFGen: A random text generator based on context-free grammars
baturin.org·37m·
Discuss: Hacker News
🌳Context free grammars
Universal Solvability for Robot Motion Planning on Graphs
arxiv.org·1d
🔄Graph Rewriting
Built a solution to the AI design recreation problem - Chromacode
github.com·1d·
Discuss: Hacker News, r/webdev
⟷Bidirectional Programming