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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

One of the fundamental problem in the theory of sorting is to find thepessimistic number of comparisons sufficient to sort a given number ofelements. Currently 16 is the lowest number of elements for which we do notknow the exact value. We know that 46 comparisons suffices and that 44 do not.There is an open question if 45 comparisons are sufficient. We present anattempt to resolve that problem by performing an exhaustive computer search. Wealso present an algorithm for counting linear extensions which substantiallyspeeds up computations.

Towards Optimal Sorting of 16 Elements