Weak lower bounds on resource-bounded compression imply strong separations of complexity classes
暂无分享,去创建一个
[1] Richard J. Lipton,et al. Time-space lower bounds for satisfiability , 2005, JACM.
[2] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[3] Moritz Müller,et al. Feasibly constructive proofs of succinct weak circuit lower bounds , 2020, Electron. Colloquium Comput. Complex..
[4] Avi Wigderson,et al. Algebrization: A New Barrier in Complexity Theory , 2009, TOCT.
[5] Boris A. Trakhtenbrot,et al. A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.
[6] Alexander A. Razborov,et al. Natural Proofs , 1997, J. Comput. Syst. Sci..
[7] Miklós Ajtai,et al. A non-linear time lower bound for Boolean branching programs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[8] Eric Allender,et al. Amplifying Lower Bounds by Means of Self-Reducibility , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[9] Rahul Santhanam,et al. On the Average-Case Complexity of MCSP and Its Variants , 2017, CCC.
[10] Richard J. Lipton,et al. Amplifying circuit lower bounds against polynomial time, with applications , 2013, 2012 IEEE 27th Conference on Computational Complexity.
[11] Igor Carboni Oliveira,et al. Hardness magnification near state-of-the-art lower bounds , 2019, Electron. Colloquium Comput. Complex..
[12] Eric Allender,et al. The Minimum Oracle Circuit Size Problem , 2016, computational complexity.
[13] Leonid A. Levin,et al. Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..
[14] Igor Carboni Oliveira,et al. Hardness Magnification for Natural Problems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[15] Aravind Srinivasan,et al. On the approximability of clique and related maximization problems , 2003, J. Comput. Syst. Sci..
[16] Miklós Ajtai,et al. Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions , 2002, J. Comput. Syst. Sci..
[17] Samuel R. Buss,et al. Limits on Alternation Trading Proofs for Time–Space Lower Bounds , 2012, computational complexity.
[18] Jin-Yi Cai,et al. Circuit minimization problem , 2000, STOC '00.
[19] John M. Hitchcock,et al. On the NP-Completeness of the Minimum Circuit Size Problem , 2015, FSTTCS.
[20] Eric Allender,et al. Power from Random Strings , 2006, SIAM J. Comput..
[21] Eric Allender,et al. When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity , 2001, FSTTCS.
[22] Osamu Watanabe,et al. Limits of Minimum Circuit Size Problem as Oracle , 2016, CCC.
[23] Michael E. Saks,et al. Time-Space Tradeoffs for Branching Programs , 2001, J. Comput. Syst. Sci..
[24] Cody Murray,et al. On the (Non) NP-Hardness of Computing Circuit Complexity , 2015, Theory Comput..
[25] Michael E. Saks,et al. Time-space trade-off lower bounds for randomized computation of decision problems , 2003, JACM.
[26] Timothy Y. Chow. Almost-natural proofs , 2011, J. Comput. Syst. Sci..
[27] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..
[28] Igor Carboni Oliveira,et al. NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits , 2018, Electron. Colloquium Comput. Complex..
[29] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[30] Ilya Volkovich,et al. The Power of Natural Properties as Oracles , 2018, Electron. Colloquium Comput. Complex..
[31] Richard Ryan Williams,et al. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[32] Shuichi Hirahara,et al. Non-Black-Box Worst-Case to Average-Case Reductions within NP , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[33] Eric Allender,et al. New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems , 2019, MFCS.