Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines
cs.CC
Submitted: 2024-06-15
Updated: 2026-10-25
Related papers
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- Optimal Unambiguous DNFs and Alon-Saks-Seymour
- On the Limits of Quantum Multiparty Simultaneous Communication
- Learning, Compression, and Meta-Complexity
- Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
- Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM