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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI