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 review NP-hardness framework and PSPACE-hardness framework for a type of2D platform games. We introduce a EXPTIME-hardness framework by defining somenew gadgets. We use these hardness frameworks to analyse computationalcomplexity of Xiangqi (Chinese Chess) and Janggi (Korean Chess). We constructall gadgets of the hardness frameworks in Xiangqi and Janggi. In conclusion, weprove that Xiangqi and Janggi are both EXPTIME-complete.

A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi