Pages that link to "Item:Q804293"
From MaRDI portal
The following pages link to Complexity of nonuniform computations for certain discrete problems (Q804293):
Displaying 6 items.
- Speedup for natural problems and noncomputability (Q620964) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- (Q3096713) (← links)
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (Q3212290) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- On the upper bounds for complexities of discrete functions (Q5876808) (← links)