The following pages link to Aarthi Sundaram (Q1678167):
Displaying 10 items.
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Secure software leasing without assumptions (Q2695627) (← links)
- Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
- Linear Time Algorithm for Quantum 2SAT (Q4598148) (← links)
- On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems (Q4608570) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- (Q5005160) (← links)
- On the Complexity of Trial and Error for Constraint Satisfaction Problems (Q5167781) (← links)
- Gottesman types for quantum programs (Q6645589) (← links)
