Pseudodeterministic constructions in subexponential time-Reference-Cited by-同舟云学术

Pseudodeterministic constructions in subexponential time

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Oliveira Igor C.¹,Santhanam Rahul²

Affiliation:

1. Charles University in Prague, Czechia

2. University of Oxford, UK

Publisher

ACM

Link

Reference45 articles.

1. PRIMES is in P;Agrawal Manindra;Ann. of Math.,2002

3. Sanjeev Arora and Boaz Barak. 2009. Sanjeev Arora and Boaz Barak. 2009.

4. Complexity Theory: A Modern Approach. Cambridge University Press. Complexity Theory: A Modern Approach. Cambridge University Press.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Polynomial-Time Pseudodeterministic Construction of Primes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Unstructured Hardness to Average-Case Randomness;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Pseudodeterminism: promises and lowerbounds;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15