Expressive Power of Graph Neural Networks for (Mixed-Integer) Quadratic Programs
arxiv.org·5h
🧩Constraint Solvers
ChemOrch: Empowering LLMs with Chemical Intelligence via Synthetic Instructions
arxiv.org·5h
🔗Parser Combinators
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
arxiv.org·5h
🔗Hash Algorithms
Efficient & Correct Predictive Equivalence for Decision Trees
arxiv.org·5h
🌳Pattern Match Compilation
From domain-landmark graph learning to problem-landmark graph generation
arxiv.org·5h
🔗Graph Rewriting
Replacing clojure-lsp with clj-kondo and Refactor-nREPL
andreyor.st·1d
🔮Clojure
Towards Cost-Effective ZK-Rollups: Modeling and Optimization of Proving Infrastructure
arxiv.org·5h
🧮Theorem Provers
SnipSnap: A Joint Compression Format and Dataflow Co-Optimization Framework for Efficient Sparse LLM Accelerator Design
arxiv.org·5h
📋JSON Parsing
Writing Our Own Structure: Tries in Haskell & Rust
mmhaskell.com·1d
🌿Trie Structures
Existence and Synthesis of Multi-Resolution Approximate Bisimulations for Continuous-State Dynamical Systems
arxiv.org·5h
⚡Control Synthesis
X Design Notes: Pattern Matching II
blog.polybdenum.com·1d
🎯Pattern Matching
PHP Almost Generics: Guided Journey Through the Official Compile-Time Proposal
doganoo.medium.com·3h·
Discuss: Hacker News
🪆Embedded DSLs
PrediPrune: Reducing Verification Overhead in Souper with Machine Learning Driven Pruning
arxiv.org·5h
🌳Pattern Match Compilation
Digging Into the Internal: Causality-Based Analysis of LLM Function Calling
arxiv.org·5h
🏗️MLIR
Automating FOWLP design: A comprehensive framework for next-generation integration
edn.com·1d
📱Bytecode Design
Talk me out of designing a monstrosity
reddit.com·2d·
Discuss: r/rust
🪞Metaprogramming
Sketching approximations and LP approximations for finite CSPs are related
arxiv.org·5h
🎨Graph Coloring
Introducing Resizable Region Packing Problem in Image Generation, with a Heuristic Solution
arxiv.org·5h
🔄Loop Optimization
From OCL to JSX: declarative constraint modeling in modern SaaS tools
arxiv.org·5h
🧱WASM Components
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
arxiv.org·5h
🧮Theorem Provers