{"identifier":"nobleid:/w1/20260521/CC2AC66F","arkIdentifier":"ark:/48914/w1/20260521/CC2AC66F","version":1,"workTitle":"Computational complexity for sum with products of Stirling numbers, factorials and binomial coefficients","workType":"Journal Article","authors":"Alexander Ivanovich Nikonov","description":null,"workUrl":null,"existingDoi":"10.12988/ams.2022.916744","createdAt":"2026-05-21T14:13:12.748920Z","canonicalUrl":"https://nobleid.org/ark:/48914/w1/20260521/CC2AC66F.v1"}