Pages that link to "Item:Q3581241"

The following pages link to Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Q3581241):

Displaying 3 items.

• Classical deterministic complexity of Edmonds' Problem and quantum entanglement (Q3581264) (← links)
• Adiabatic quantum state generation and statistical zero knowledge (Q3581286) (← links)
• Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5901095) (← links)