Pages that link to "Item:Q488049"
From MaRDI portal
The following pages link to On uniformity and circuit lower bounds (Q488049):
Displaying 18 items.
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- P-uniform circuit complexity (Q3474881) (← links)
- Uniform Derandomization from Pathetic Lower Bounds (Q3588422) (← links)
- A Uniform Circuit Lower Bound for the Permanent (Q4312420) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (Q5230346) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311109) (← links)
- Extensional Uniformity for Boolean Circuits (Q5390592) (← links)
- Proving Circuit Lower Bounds in High Uniform Classes (Q5417530) (← links)
- Fundamentals of Computation Theory (Q5900807) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)