| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complete Problems for Multi-Pseudodeterministic Computations | Dixon, Peter et al. | 2021 |
| 2 | On Pseudodeterministic Approximation Algorithms | Dixon, Peter et al. | 2018 |
| 3 | A Note on the Advice Complexity of Multipass Randomized Logspace | Dixon, Peter et al. | 2016 |
| 4 | On the NP-Completeness of the Minimum Circuit Size Problem | Hitchcock, John M. et al. | 2015 |
| 5 | New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs | Chakraborty, Diptarka et al. | 2014 |
| 6 | Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis | Mandal, Debasis et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |