On the Range Avoidance Problem for Circuits-Reference-Cited by-同舟云学术

On the Range Avoidance Problem for Circuits

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Ren Hanlin¹,Santhanam Rahul¹,Wang Zhikun²

Affiliation:

1. University of Oxford,Dept. of Computer Science,Oxford,UK

2. Xi’an Jiaotong University,School of CS&T,Xi’an,China

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9996589/9996592/09996645.pdf?arnumber=9996645

Reference62 articles.

1. Improving Exhaustive Search Implies Superpolynomial Lower Bounds

2. Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits

3. Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of #SAT algorithms;vyas;In Proc 37th Symposium on Theoretical Aspects of Computer Science (STACS),2020

4. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova. Learning algorithms from natural proofs;marco;In Proc 31st Computational Complexity Conference (CCC),2016

5. Natural Proofs versus Derandomization

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

1. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02