Computer science
The Lean Pool projects whose card's first MSC2020 code is in class 68, Computer science: 21 articles, one per card.
2-Coloring Cycles in One Round to Sharp list-scheduling and…
- 2-Coloring Cycles in One Round
- The Aaronson–Ambainis influence conjecture
- Adversary bounds and the polynomial method for quantum queries
- Beyond the Bethe approximation of the permanent
- Block sensitivity can exceed spectral sensitivity squared
- Circuit Complexity in Lean 4
- Coinductive Interaction Trees using QPFs
- Event Structures and Causal-Consistent Reversibility
- Exact Boolean multiplicative complexity of four-term polynomial multiplication
- Finite witnesses and the width hierarchy for language generation
- Formal Learning Theory Kernel
- Formalizations of theorems related to model checking
- The Johnson–Lindenstrauss Lemma and Quantized JL
- Matrix multiplication exponent at most 9/4 over every field
- MRiscX
- Polynomial-factor hardness of the closest vector problem
- Pumping Lemma for Context-Free Grammars
- Pure Nock semantics, trace certificates, and polynomial fingerprints
- Quartic-over-logarithmic lower bound for rational permanent formulas
- Sharp list-scheduling and longest-processing-time bounds
Sundog certificates
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.