English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The computational complexity of the , which concerns the partitioning of a set of  vectors in -space into  parts so as to maximize an objective function which is convex on the sum of vectors in each part, is determined by the number of vertices of the corresponding  defined to be the convex hull in  × )-space of all solutions.In this article, introducing and using the class of , we establish the lower bound  ()= Ω(  ) on the maximum number of vertices of any -partition polytope of a set of  points in -space, which is quite compatible with the recent upper bound  ()=( , implying the same bound on the complexity of the partition problem. We also discuss related problems on the realizability of Davenport—Schinzel sequences and describe some further properties of Momentopes.

Momentopes, the Complexity of Vector Partitioning, and Davenport—Schinzel Sequences