Pages that link to "Item:Q3323851"
From MaRDI portal
The following pages link to Circuit-size lower bounds and non-reducibility to sparse sets (Q3323851):
Displayed 17 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Optimal advice (Q672755) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- On proving time constructibility of functions (Q1059393) (← links)
- On solving hard problems by polynomial-size circuits (Q1095663) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- On randomized versus deterministic computation (Q1365675) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- A note on the circuit complexity of PP (Q2576885) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- On problems for which no oracle can help (Q3829070) (← links)
- Complete sets and closeness to complexity classes (Q4727430) (← links)