Pages that link to "Item:Q1177170"
From MaRDI portal
The following pages link to Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170):
Displaying 11 items.
- Strong polynomial-time reducibility (Q676314) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- Robust reductions (Q1125798) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Robustness of PSPACE-complete sets (Q2379952) (← links)
- (Q3811710) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- Dot operators (Q5958134) (← links)