Cs-Cc
Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
I/O complexity and pebble games with partial computations
Eulerian orientations and Hadamard codes: A novel connection via counting
The Quantumly Fast and the Classically Forrious
VERIFY-RL: Verifiable Recursive Decomposition for Reinforcement Learning in Mathematical Reasoning
Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank
Determining the Outerthickness of Graphs Is NP-Hard
