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

Polyhedral projection is a main operation of the polyhedron abstractdomain.It can be computed via parametric linear programming (PLP), which ismore efficient than the classic Fourier-Motzkin elimination method.In priorwork, PLP was done in arbitrary precision rational arithmetic.In this paper, wepresent an approach where most of the computation is performed infloating-point arithmetic, then exact rational results are reconstructed.Wealso propose a workaround for a difficulty that plagued previous attempts atusing PLP for computations on polyhedra: in general the linear programmingproblems are degenerate, resulting in redundant computations and geometricdescriptions.

An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection