A Note on the Theoretical Support to Compute Dimension in Abelian Codes
arxiv.org·5h
⚗️Polynomial Codes
Program Optimisations via Hylomorphisms for Extraction of Executable Code
drops.dagstuhl.de·5h·
Discuss: Hacker News
👑Coq Tactics
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
arxiv.org·5h
🧮Theorem Proving
Compositional Interface Refinement Through Subtyping in Probabilistic Session Types
arxiv.org·5h
📞Session Types
Evaluation Codes in Bottleneck Metrics
arxiv.org·5h
🎯Performance Proofs
Taking a Look at Compression Algorithms
cefboud.com·1d·
Discuss: Hacker News, Hacker News, r/programming
📦Deflate
Adaptive Qubit-Mapped OFDM for Resilient Wideband Communications
dev.to·15h·
Discuss: DEV
⚛️Quantum Codecs
Outer Channel of DNA-Based Data Storage: Capacity and Efficient Coding Schemes
arxiv.org·5h
🧬Palindrome Codes
Vanishing of Schubert coefficients in probabilistic polynomial time
arxiv.org·5h
🎯Performance Proofs
Theory Meets Practice for Bit Vectors Supporting Rank and Select
arxiv.org·5h
🔢Bitwise Algorithms
Code distances: a new family of invariants of linear codes
arxiv.org·5h
📏Linear Codes
Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
arxiv.org·5h
🔗Graph Isomorphism
Efficient & Correct Predictive Equivalence for Decision Trees
arxiv.org·5h
🧠Machine Learning
Proof Rules for MetaSMT
philipzucker.com·1d
🧮Z3 Solver
Implicit Communication in Linear Quadratic Gaussian Control Systems
arxiv.org·1d
🧠Machine Learning
X Design Notes: Pattern Matching II
blog.polybdenum.com·1d
💻Programming languages
Writing Our Own Structure: Tries in Haskell & Rust
mmhaskell.com·1d
🌳Trie Structures
Creating a database of motivated proofs
gowers.wordpress.com·11h·
Discuss: Hacker News
🎯Performance Proofs
Reinforced Generation of Combinatorial Structures: Applications to Complexity Theory
arxiv.org·5h
🎯Performance Proofs
pBeeGees: A Prudent Approach to Certificate-Decoupled BFT Consensus
arxiv.org·5h
🛡️Byzantine Fault Tolerance