Sledovat
Peter Dixon
Název
Citace
Citace
Rok
On pseudodeterministic approximation algorithms
P Dixon, A Pavan, NV Vinodchandran
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
162018
List and certificate complexities in replicable learning
P Dixon, A Pavan, J Vander Woude, NV Vinodchandran
Advances in Neural Information Processing Systems 36, 2024
82024
Complete problems for multi-pseudodeterministic computations
P Dixon, A Pavan, NV Vinodchandran
Innovations in Theoretical Computer Science, 2021
72021
Pseudodeterminism: promises and lowerbounds
P Dixon, A Pavan, JV Woude, NV Vinodchandran
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
62022
Perfect Zero Knowledge: New Upperbounds and Relativized Separations
P Dixon, S Gayen, A Pavan, NV Vinodchandran
TCC, 2020
42020
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma
J Vander Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran
arXiv e-prints, arXiv: 2304.04837, 2023
3*2023
Promise Problems Meet Pseudodeterminism
P Dixon, A Pavan, NV Vinodchandran
arXiv preprint arXiv:2103.08589, 2021
22021
A Note on the Advice Complexity of Multipass Randomized Logspace
P Dixon, D Mandal, A Pavan, NV Vinodchandran
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
12016
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube
JV Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran
arXiv preprint arXiv:2306.12593, 2023
2023
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube
J Vander Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran
arXiv e-prints, arXiv: 2306.12593, 2023
2023
Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes
P Dixon
Iowa State University, 2021
2021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–11