The following pages link to On 1-truth-table-hard languages (Q1261477):
Displaying 10 items.
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- Almost every set in exponential time is P-bi-immune (Q1349712) (← links)
- Almost complete sets. (Q1426448) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Two queries (Q1961371) (← links)
- Autoreducibility and mitoticity of logspace-complete sets for NP and other classes (Q2407092) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- Almost every set in exponential time is P-bi-immune (Q5096852) (← links)
- Every polynomial-time 1-degree collapses if and only if P = PSPACE (Q5311749) (← links)
- Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998 (Q5929910) (← links)
