Similar Items: Multi-Prover Interactive Proof Systems with Leakage
- Hard CNF Instances for Ideal Proof Systems
- Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
- CARMEN: CORDIC-Accelerated Resource-Efficient Multi-Precision Inference Engine for Deep Learning
- A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'