Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PROBABILISTIC KOLMOGOROV COMPLEXITY:
Reports tagged with probabilistic Kolmogorov complexity:
TR23-028 | 15th March 2023
Rahul Santhanam

An Algorithmic Approach to Uniform Lower Bounds

We propose a new family of circuit-based sampling tasks, such that non-trivial algorithmic solutions to certain tasks from this family imply frontier uniform lower bounds such as ``NP is not in uniform ACC^0" and ``NP does not have uniform polynomial-size depth-two threshold circuits". Indeed, the most general versions of our ... more >>>




ISSN 1433-8092 | Imprint