Pages that link to "Item:Q4140380"
From MaRDI portal
The following pages link to Inclusion complete tally languages and the Hartmanis-Berman conjecture (Q4140380):
Displayed 9 items.
- The complexity of unions of disjoint sets (Q955349) (← links)
- A low and a high hierarchy within NP (Q1052097) (← links)
- Reductions on NP and p-selective sets (Q1166515) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- On sparse sets in NP-P (Q1172386) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP (Q4190619) (← links)