The following pages link to (Q4938667):
Displayed 12 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- The size of SPP (Q596117) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- (Q5121894) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Well spaced integers generated by an infinite set of primes (Q5496429) (← links)