Pages that link to "Item:Q1920145"
From MaRDI portal
The following pages link to On the complexity of computations on monomials and tuples of powers (Q1920145):
Displaying 8 items.
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- Complexity of certain systems of monomials in calculation by composition circuits (Q2018044) (← links)
- Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733) (← links)
- (Q3156435) (← links)
- (Q3773338) (← links)
- THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS (Q5155649) (← links)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769) (← links)
- The Determinants over Associative Rings: a Definition, Properties, New Formulas and a Computational Complexity (Q5853016) (← links)