The following pages link to A Turing machine time hierarchy (Q593780):
Displaying 27 items.
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- Some properties of sets tractable under every polynomial-time computable distribution (Q1350351) (← links)
- On P-immunity of exponential time complete sets (Q1362336) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Local reduction (Q1641001) (← links)
- Catalytic space: non-determinism and hierarchy (Q1702851) (← links)
- Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- An application of the translational method (Q4285626) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- On the cutting edge of relativization: The resource bounded injury method (Q4632432) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5121894) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Language classes associated with automata over matrix groups (Q5223619) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Effective guessing has unlikely consequences (Q6109068) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
