Aarthi Sundaram

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Gottesman types for quantum programs	2024-11-28	Paper
Secure software leasing without assumptions (available as arXiv preprint)	2023-03-31	Paper
Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) Computational Complexity	2022-10-21	Paper
Quantum generalizations of the polynomial hierarchy with applications to QMA(2) (available as arXiv preprint)	2021-08-04	Paper
Quantum hardness of learning shallow classical circuits SIAM Journal on Computing	2021-06-22	Paper
Linear-Time Algorithm for Quantum 2SAT Theory of Computing	2018-06-15	Paper
On the complexity of probabilistic trials for hidden satisfiability problems (available as arXiv preprint)	2018-03-21	Paper
Linear time algorithm for quantum 2SAT (available as arXiv preprint)	2017-12-19	Paper
On the complexity of trial and error for constraint satisfaction problems Journal of Computer and System Sciences	2017-11-14	Paper
On the complexity of trial and error for constraint satisfaction problems Journal of Computer and System Sciences	2017-11-14	Paper
On the complexity of trial and error for constraint satisfaction problems Automata, Languages, and Programming	2014-07-01	Paper

Research outcomes over time

This page was built for person: Aarthi Sundaram