Pages that link to "Item:Q5264769"
From MaRDI portal
The following pages link to Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769):
Displaying 6 items.
- On some measures of complexity of finite abelian groups (Q1675532) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- On the complexity of computations on monomials and tuples of powers (Q1920145) (← links)
- Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733) (← links)
- (Q3773338) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)