Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

info@nobleid.org

About FAQ Developers Terms Policy Persistence & Resolver Service Policy

v1

Computational complexity for sum with products of Stirling numbers, factorials and binomial coefficients

Alexander Ivanovich Nikonov

AN

Alexander Ivanovich Nikonov

NobleIDNI3P31W56R85S21

Type:Journal Article

Claim Your Authorship

Sign in to see the full record

Creating an account is free.

Create an account

For data access, contact info@nobleid.org.