Similar Items: Towards infinite PCSP: a dichotomy for monochromatic cliques
- Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
- Toward a Characterization of Simulation Between Arithmetic Theories
- A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
- Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
- Optimal Inapproximability of Generalized Linear Equations over a Finite Group
- En Route to a Standard QMA1 vs. QCMA Oracle Separation