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

We consider the firing squad synchronization problems for paths in the twoand the three-dimensional grid spaces. Minimal-time solutions of these problemsare not known and are unlikely to exist. However, at present we have no proofsof their nonexistence. In this paper we show one result that suggests what typeof study is necessary in order to prove their nonexistence.

Minimum firing times of firing squad synchronization problems for paths in grid spaces