On the range avoidance problem for circuits
From MaRDI portal
Cited in
(11)- Range avoidance for low-depth circuits and connections to pseudorandomness
- Regularization of low error PCPs and an application to MCSP
- Symmetric exponential time requires near-maximum circuit size
- Oblivious complexity classes revisited: lower bounds and hierarchies
- Algebraic pseudorandomness in VNC^0
- How to construct random strings
- Avoiding range via Turán-type bounds
- New algebrization barriers to circuit lower bounds via communication complexity of missing-string
- Total search problems in ZPP
- Range avoidance and remote point: new algorithms and hardness
- Hardness of range avoidance and proof complexity generators from demi-bits
This page was built for publication: On the range avoidance problem for circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943025)