Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP-Reference-Cited by-同舟云学术

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP

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

Author:

Murray Cody¹,Williams Ryan¹

Affiliation:

1. Massachusetts Institute of Technology, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188910

Reference37 articles.

1. Sanjeev Arora and Boaz Barak. 2009. Sanjeev Arora and Boaz Barak. 2009.

2. Computational Complexity - A Modern Approach. Cambridge University Press. Computational Complexity - A Modern Approach. Cambridge University Press.

3. BPP has subexponential time simulations unlessEXPTIME has publishable proofs

4. On ACC

5. Eli Ben-Sasson and Emanuele Viola. 2014. Short PCPs with projection queries. In ICALP. 163–173. Eli Ben-Sasson and Emanuele Viola. 2014. Short PCPs with projection queries. In ICALP. 163–173.

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

1. Guest Column: New ways of studying the BPP = P conjecture;ACM SIGACT News;2023-06-13

2. On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds;Journal of the ACM;2023-04-20

3. Generation of small complexity classes using logical formulas, schemes and operations of bounded concatenation;Mathematical Problems of Cybernetics;2023

4. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms;Theory of Computing Systems;2022-11-04

5. Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization;SIAM Journal on Computing;2022-05-02