94 research outputs found

    Knapsack Problems in Groups

    Full text link
    We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in hyperbolic groups and give various examples of finitely presented groups where the subset sum problem is NP-complete.Comment: 28 pages, 12 figure

    Совокупная факторная производительность в российских регионах в 2000–2014 гг.

    Get PDF
    The article offers a calculation of total factor productivity (TFP) in Russian regions in 2000–2014. Because of the quality issues with available data, the main conclusions in the article are based on average rather than annual TFP values for each region. It is shown that there is a highly significant positive link between the share of extracting industries in a regional economy and the TFP of the respective region. The author argues that TFP grew faster in regions with the highest shares of mineral resource extractio
    corecore