Computational Complexity
Bibliographic References tagged with Computational Complexity
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Vadhan, Salil. “The Complexity of Counting in Sparse, Regular, and Planar Graphs.”. SIAM Journal on Computing 31, no. 2 (2001): 398-427.
Vadhan, Salil. “The Complexity of Counting in Sparse, Regular, and Planar Graphs.”. SIAM Journal on Computing 31, no. 2 (2001): 398-427.
Sahai, Amit, and Salil Vadhan. “A Complete Problem for Statistical Zero Knowledge.”. Journal of the ACM 50, no. 2 (2003): 196-249.
Sahai, Amit, and Salil Vadhan. “A Complete Problem for Statistical Zero Knowledge.”. Journal of the ACM 50, no. 2 (2003): 196-249.
Sahai, Amit, and Salil Vadhan. “ Manipulating Statistical Difference.”. Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-70.
Sahai, Amit, and Salil Vadhan. “ Manipulating Statistical Difference.”. Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-70.
Goldreich, Oded, Amit Sahai, and Salil Vadhan. “Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98), 1998, 399-408.
Goldreich, Oded, Amit Sahai, and Salil Vadhan. “Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98), 1998, 399-408.
Chen, Yi-Hsiu, Mika Goos, Salil P. Vadhan, and Jiapeng Zhang. “A Tight Lower Bound for Entropy Flattening”. In 33rd Computational Complexity Conference (CCC 2018), 102:23:21-23:28. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik: Leibniz International Proceedings in Informatics (LIPIcs), 2018.
Chen, Yi-Hsiu, Mika Goos, Salil P. Vadhan, and Jiapeng Zhang. “A Tight Lower Bound for Entropy Flattening”. In 33rd Computational Complexity Conference (CCC 2018), 102:23:21-23:28. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik: Leibniz International Proceedings in Informatics (LIPIcs), 2018.
Chen, Yi-Hsiu, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, and Xiaodi Wu. “Computational Notions of Quantum Min-Entropy.”. In Poster Presention at QIP 2017 and Oral Presentation at QCrypt 2017.
Chen, Yi-Hsiu, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, and Xiaodi Wu. “Computational Notions of Quantum Min-Entropy.”. In Poster Presention at QIP 2017 and Oral Presentation at QCrypt 2017.
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space.”. 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS `17).
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space.”. 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS `17).
Vadhan., Salil P. “On Learning Vs. Refutation”. 30th Conference on Learning Theory (COLT `17).
Vadhan., Salil P. “On Learning Vs. Refutation”. 30th Conference on Learning Theory (COLT `17).
Agrawal, Rohit, Yi-Hsiu Chen, Thibaut Horel, and Salil Vadhan. “Unifying Computational Entropies via Kullback-Leibler Divergence”. In Advances in Cryptology: CRYPTO 2019, A. Boldyreva and D. Micciancio, (Eds), 11693:831-58. Springer Verlag, Lecture Notes in Computer Science, 2019.
Agrawal, Rohit, Yi-Hsiu Chen, Thibaut Horel, and Salil Vadhan. “Unifying Computational Entropies via Kullback-Leibler Divergence”. In Advances in Cryptology: CRYPTO 2019, A. Boldyreva and D. Micciancio, (Eds), 11693:831-58. Springer Verlag, Lecture Notes in Computer Science, 2019.
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Deterministic Approximation of Random Walks in Small Space”. Theory of Computing Special Issue on APPROX-RANDOM ’19 17(4) (2021): 1-35.
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Deterministic Approximation of Random Walks in Small Space”. Theory of Computing Special Issue on APPROX-RANDOM ’19 17(4) (2021): 1-35.