Pages that link to "Item:Q5374005"

The following pages link to Computational complexity of the original and extended diophantine Frobenius problem (Q5374005):

Displaying 2 items.

• Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices (Q4558298) (← links)
• On improved universal estimation of exponents of digraphs (Q5151259) (← links)